All listings for this product
Best-selling in Non-Fiction Books
Save on Non-Fiction Books
- AU $32.27Trending at AU $36.78
- AU $16.41Trending at AU $22.77
- AU $14.93Trending at AU $21.99
- AU $27.74Trending at AU $29.97
- AU $13.01Trending at AU $16.62
- AU $14.82Trending at AU $17.90
- AU $25.99Trending at AU $32.06
About this product
- DescriptionIn 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 forty years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation.
- Author BiographyDan Romik is Professor of Mathematics at the University of California, Davis.
- PrizesWinner of Choice Magazine Outstanding Reference/Academic Book Award 2015.
- Author(s)Dan Romik
- PublisherCambridge University Press
- Date of Publication02/02/2015
- SubjectScience & Mathematics: Textbooks & Study Guides
- Series TitleInstitute of Mathematical Statistics Textbooks
- Series Part/Volume Number4
- Place of PublicationCambridge
- Country of PublicationUnited Kingdom
- ImprintCambridge University Press
- Content Note3 b/w illus. 94 exercises
- Weight520 g
- Width152 mm
- Height228 mm
- Spine20 mm
- Format DetailsTrade paperback (US)
This item doesn't belong on this page.
Thanks, we'll look into this.