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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dan Romik is Professor of Mathematics at the University of California, Davis.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: HPB-Red, Dallas, TX, U.S.A.
hardcover. Condizione: 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! Codice articolo S_419860290
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 21303161-n
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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. Codice articolo 9781107075832
Quantità: 1 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781107075832
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781107075832_new
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 21303161-n
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 353 pages. 9.00x5.00x1.00 inches. In Stock. This item is printed on demand. Codice articolo __1107075831
Quantità: 1 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: 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. . . . . Codice articolo V9781107075832
Quantità: 1 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781107075832
Quantità: Più di 20 disponibili
Da: Speedyhen, Hertfordshire, Regno Unito
Condizione: NEW. Codice articolo NW9781107075832
Quantità: 1 disponibili