Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Surprising mathematics of longest increasing subsequences / Dan Romik.

By: Material type: TextTextSeries: Institute of Mathematical Statistics textbooksPublication details: New York : Cambridge University Press, 2015.Description: xi, 353 p. : illustrations ; 24 cmISBN:
  • 9781107428829 (paperback)
Subject(s): DDC classification:
  • 511.6 23 R765
Contents:
0. A few things you need to know -- 1. Longest increasing subsequences in random permutations -- 2. The Baik-Deift-Johansson theorem -- 3. Erdîos-Szekeres permutations and square Young tableaux -- 4. The corner growth process: limit shapes -- 5. The corner growth process: distributional results -- Appendix: Kingman's subadditive ergodic theorem -- Notes -- References -- Index.
Summary: This book presents for the first time to a graduate-level readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem. Its detailed, playful presentation provides a motivating entry to elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists and statisticians.
Tags from this library: No tags from this library for this title. Log in to add tags.

Includes bibliographical references and index.

0. A few things you need to know --
1. Longest increasing subsequences in random permutations --
2. The Baik-Deift-Johansson theorem --
3. Erdîos-Szekeres permutations and square Young tableaux --
4. The corner growth process: limit shapes --
5. The corner growth process: distributional results --
Appendix: Kingman's subadditive ergodic theorem --
Notes --
References --
Index.

This book presents for the first time to a graduate-level readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem. Its detailed, playful presentation provides a motivating entry to elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists and statisticians.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in