PayPal accepted MORE INFO

Close Notification

Your cart does not contain any items

The Surprising Mathematics of Longest Increasing Subsequences

Dan Romik (University of California, Davis)

$54.95

Paperback

We can order this in for you
How long will it take?

QTY:

Cambridge University Press
02 February 2015
Mathematics & Sciences; Probability & statistics
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.
By:   Dan Romik (University of California Davis)
Imprint:   Cambridge University Press
Country of Publication:   United Kingdom
Volume:   4
Dimensions:   Height: 227mm,  Width: 152mm,  Spine: 20mm
Weight:   520g
ISBN:   9781107428829
ISBN 10:   1107428823
Series:   Institute of Mathematical Statistics Textbooks
Pages:   363
Publication Date:   02 February 2015
Audience:   Professional and scholarly ,  Undergraduate
Format:   Paperback
Publisher's Status:   Active

Dan Romik is Professor of Mathematics at the University of California, Davis.

Reviews for The Surprising Mathematics of Longest Increasing Subsequences

Advance praise: 'The story of longest monotone subsequences in permutations has been, for six decades, one of the most beautiful in mathematics, ranging from the very pure to the applied and featuring many terrific mathematicians, starting with Erdos-Szekeres's 'happy end theorem' and continuing through the Tracy-Widom distribution and the breakthrough of Baik-Deift-Johansson. With its connections to many areas of mathematics, to the Riemann hypothesis, and to high-energy physics we cannot foresee where the story is heading. Dan Romik tells the tale thus far - and teaches its rich multifaceted mathematics, a blend of probability, combinatorics, analysis, and algebra - in a wonderful way.' Gil Kalai, Hebrew University Advance praise: 'How long is the longest increasing subsequence in a random permutation? This innocent-looking combinatorial problem has surprisingly rich connections to diverse mathematical areas: Poisson processes and Last-passage percolation, growth processes and random matrices, Young diagrams and special functions ... Its solution weaves together some highlights of nineteenth- and twentieth-century mathematics, yet continues to have growing impact in the twenty-first. Dan Romik's excellent book makes these exciting developments available to a much wider mathematical audience than ever before. The minimal prerequisites ensure that the reader will also encounter mathematical tools that have stood the test of time and can be applied to many other concrete problems. This is a wonderful story of the unity of mathematics, and Romik's enthusiasm for it shines through.' Yuval Peres, Principal Researcher, Microsoft Advance praise: 'This is a marvelously readable book that coaches the reader toward an honest understanding of some of the deepest results of modern analytic combinatorics. It is written in a friendly but rigorous way, complete with exercises and historical sidebars. The central result is the famous Baik-Deift-Johansson theorem that determines the asymptotic distribution of the length of the longest increasing subsequence of a random permutation, but many delicious topics are covered along the way. Anyone who is interested in modern analytic combinatorics will want to study this book. The time invested will be well rewarded - both by enjoyment and by the acquisition of a powerful collection of analytical tools.' Michael Steele, University of Pennsylvania Advance praise: 'Mathematics books that concentrate on a problem, rather than on a technique or a subfield, are relatively rare but can be a wonderfully exciting way to dive into research. Here we have the felicitous combination of an extraordinarily fascinating and fruitful problem and a literate tour guide with a terrific eye for the best proof. More like a detective story than a text, this elegant volume shows how a single wise question can open whole new worlds.' Peter Winkler, Dartmouth College


  • Winner of Choice Magazine Outstanding Reference/Academic Book Award 2015
  • Winner of Choice Magazine Outstanding Reference/Academic Book Award 2015.
  • Winner of Choice Outstanding Academic Title 2015

See Also

Applied Stochastic Differential...

Simo Sarkka

Paperback

Computational Bayesian Statistics:...

M. Antonia Amaral Turkman (Universidade...

Paperback

Bayesian Filtering and Smoothing...

Simo Sarkka

Paperback

Stochastic Networks

Frank Kelly

Paperback

Noise Sensitivity of Boolean Functions...

Christophe Garban (Universite Lyon...

Paperback