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.
"synopsis" may belong to another edition of this title.
Dan Romik is Professor of Mathematics at the University of California, Davis.
"About this title" may belong to another edition of this title.
Seller: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_419860290
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 21303161-n
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condition: new. Hardcover. 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-KerovLogan-Shepp limit shape theorem, the BaikDeiftJohansson theorem, the TracyWidom 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. This book presents for the first time to a graduate-level readership recent groundbreaking developments in probability and combinatorics related to the longest increasing subsequence problem. Its detailed, playful presentation provides a motivating entry to elegant mathematical ideas that are of interest to every mathematician and to many computer scientists, physicists and statisticians. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9781107075832
Seller: California Books, Miami, FL, U.S.A.
Condition: New. Seller Inventory # I-9781107075832
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9781107075832_new
Quantity: Over 20 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 21303161-n
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Hardcover. Condition: Brand New. 353 pages. 9.00x5.00x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __1107075831
Quantity: 1 available
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781107075832
Quantity: Over 20 available
Seller: Speedyhen, Hertfordshire, United Kingdom
Condition: NEW. Seller Inventory # NW9781107075832
Quantity: 1 available
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 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. Series: Institute of Mathematical Statistics Textbooks. Num Pages: 366 pages, 3 b/w illus. 94 exercises. BIC Classification: PBT. Category: (U) Tertiary Education (US: College). Dimension: 237 x 160 x 25. Weight in Grams: 628. . 2015. Illustrated. hardcover. . . . . Seller Inventory # V9781107075832