Normal view MARC view ISBD view

The surprising mathematics of longest increasing subsequences / Dan Romik.

By: Romik, Dan, 1976- [author.].
Material type: TextTextSeries: Institute of Mathematical Statistics textbooks.Publisher: New York : Cambridge University Press, 2015Description: xi, 353 pages : USD 39.99 illustrations ; 24 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9781107075832 (hardback); 1107075831 (hardback); 9781107428829 (paperback); 1107428823 (paperback).Subject(s): Combinatorial analysis | Probabilities | MATHEMATICS / Probability & Statistics / GeneralDDC classification: 511/.6 Other classification: MAT029000 Online resources: Cover image
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.
Summary: "In a surprising sequence of developments, the longest increasing subsequence problem, originally mentioned as merely a curious example in a 1961 paper, has proven to have deep connections to many seemingly unrelated branches of mathematics, such as random permutations, random matrices, Young tableaux, and the corner growth model. The detailed and playful study of these connections makes this book suitable as a starting point for a wider exploration of elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists, and statisticians. The specific topics covered are the Vershik-Kerov-Logan-Shepp limit shape theorem, the Baik-Deift-Johansson theorem, the Tracy-Widom distribution, and the corner growth process. This exciting body of work, encompassing important advances in probability and combinatorics over the last 40 years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation"-- Provided by publisher.
List(s) this item appears in: 2015-07-01
Item type Current location Call number Status Date due Barcode Item holds
Book Chennai Mathematical Institute
General Stacks
511.6 ROM (Browse shelf) Available 9559
Total holds: 0

Includes bibliographical references (pages 340-347) 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.

"In a surprising sequence of developments, the longest increasing subsequence problem, originally mentioned as merely a curious example in a 1961 paper, has proven to have deep connections to many seemingly unrelated branches of mathematics, such as random permutations, random matrices, Young tableaux, and the corner growth model. The detailed and playful study of these connections makes this book suitable as a starting point for a wider exploration of elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists, and statisticians. The specific topics covered are the Vershik-Kerov-Logan-Shepp limit shape theorem, the Baik-Deift-Johansson theorem, the Tracy-Widom distribution, and the corner growth process. This exciting body of work, encompassing important advances in probability and combinatorics over the last 40 years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation"-- Provided by publisher.