Print List Price: | CDN$ 46.95 |
Kindle Price: | CDN$ 44.60 Save CDN$ 2.35 (5%) |
includes free international wireless delivery via Amazon Whispernet |

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.
The Surprising Mathematics of Longest Increasing Subsequences (Institute of Mathematical Statistics Textbooks Book 4) 1st Edition, Kindle Edition
Amazon Price | New from | Used from |
Hardcover, Illustrated
"Please retry" | $119.95 | $113.45 |
Paperback, Illustrated
"Please retry" | $46.95 | $43.19 |
Mass Market Paperback
"Please retry" |
—
| $147.91 | — |
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.
- ISBN-13978-1107075832
- Edition1st
- PublisherCambridge University Press
- Publication dateFeb. 2 2015
- LanguageEnglish
- File size17599 KB
Due to its large file size, this book may take longer to download
Kindle e-Readers
- Kindle (5th Generation)
- Kindle Keyboard
- Kindle DX
- Kindle (2nd Generation)
- Kindle (1st Generation)
- Kindle Paperwhite
- Kindle Paperwhite (5th Generation)
- Kindle Touch
- Kindle
- Kindle Oasis
Fire Tablets
Free Kindle Reading Apps
-
Next 3 for you in this series
CDN$128.64 -
Next 5 for you in this series
CDN$196.68 -
All 15 for you in this series
CDN$606.08
Next 3 for you in this series
See full series
Next 5 for you in this series
See full series
All 15 for you in this series
See full series
Total Price:
CDN$606.08
Sold by: Amazon.com.ca, Inc.
Books In This Series (15 Books)
Page 1 of 1Start OverPage 1 of 1
Product description
Review
"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 Erdős-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
"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
"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
"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
"Timely, authoritative, and unique in its coverage …"
D. V. Feldman, Choice --This text refers to the paperback edition.
Gil Kalai, Hebrew University
"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
"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
"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
"Timely, authoritative, and unique in its coverage …"
D. V. Feldman, Choice --This text refers to the paperback edition.
About the Author
Dan Romik is Professor of Mathematics at the University of California, Davis. --This text refers to the paperback edition.
Book Description
This book presents for the first time to a general readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem. --This text refers to the paperback edition.
Product details
- ASIN : B00Q8TWU5A
- Publisher : Cambridge University Press; 1st edition (Feb. 2 2015)
- Language : English
- File size : 17599 KB
- Simultaneous device usage : Up to 4 simultaneous devices, per publisher limits
- Text-to-Speech : Enabled
- Screen Reader : Supported
- Enhanced typesetting : Enabled
- X-Ray for textbooks : Enabled
- Word Wise : Not Enabled
- Sticky notes : On Kindle Scribe
- Print length : 445 pages
- Customer Reviews:
About the author
Follow authors to get new release updates, plus improved recommendations.

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
4.7 out of 5 stars
4.7 out of 5
5 global ratings
How are ratings calculated?
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzes reviews to verify trustworthiness.
Top reviews from other countries

P. Rabinovitch
5.0 out of 5 stars
Wonderful
Reviewed in the United States 🇺🇸 on March 30, 2015Verified Purchase
This is an excellent book. Its style reminds me of Bressoud's "Proofs and Confirmations".
Report abuse