The Surprising Mathematics of Longest Increasing Subsequences

The Surprising Mathematics of Longest Increasing Subsequences
Author :
Publisher : Cambridge University Press
Total Pages : 366
Release :
ISBN-13 : 9781107075832
ISBN-10 : 1107075831
Rating : 4/5 (31 Downloads)

Book Synopsis The Surprising Mathematics of Longest Increasing Subsequences by : Dan Romik

Download or read book The Surprising Mathematics of Longest Increasing Subsequences written by Dan Romik and published by Cambridge University Press. This book was released on 2015-02-02 with total page 366 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 forty years, is made accessible to a general graduate-level audience for the first time in a highly polished presentation.


The Surprising Mathematics of Longest Increasing Subsequences Related Books

The Surprising Mathematics of Longest Increasing Subsequences
Language: en
Pages: 366
Authors: Dan Romik
Categories: Mathematics
Type: BOOK - Published: 2015-02-02 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

In a surprising sequence of developments, the longest increasing subsequence problem, originally mentioned as merely a curious example in a 1961 paper, has prov
Reachability Problems
Language: en
Pages: 251
Authors: Laura Kovács
Categories:
Type: BOOK - Published: - Publisher: Springer Nature

DOWNLOAD EBOOK

Combinatorics and Random Matrix Theory
Language: en
Pages: 478
Authors: Jinho Baik
Categories: Mathematics
Type: BOOK - Published: 2016-06-22 - Publisher: American Mathematical Soc.

DOWNLOAD EBOOK

Over the last fifteen years a variety of problems in combinatorics have been solved in terms of random matrix theory. More precisely, the situation is as follow
Descriptional Complexity of Formal Systems
Language: en
Pages: 233
Authors: Cezar Câmpeanu
Categories: Mathematics
Type: BOOK - Published: 2016-07-13 - Publisher: Springer

DOWNLOAD EBOOK

his book constitutes the refereed proceedings of the 18th International Conference on Descriptional Complexity of Formal Systems, DCFS 2016, held in Bucharest,
Combinatorial Algorithms
Language: en
Pages: 405
Authors: Costas Iliopoulos
Categories: Computers
Type: BOOK - Published: 2018-07-03 - Publisher: Springer

DOWNLOAD EBOOK

This book constitutes the refereed post-conference proceedings of the 29th International Workshop on Combinatorial Algorithms, IWOCA 2018, held in Singapore, Si