Over the last fifteen years a variety of problems in combinatorics has been solved in terms of random matrix theory. More precisely, the situation is as follows: the problems at hand are probabilistic in nature and, in an appropriate scaling limit, it turns out that certain key quantities associated with these problems behave statistically like the eigenvalues of a (large) random matrix. Said differently, random matrix theory provides a ``stochastic special function theory'' for a broad and growing class of problems in combinatorics. The goal of this book is to analyze in detail two key examples of this phenomenon, viz., Ulam's problem for increasing subsequences of random permutations and domino tilings of the Aztec diamond. Other examples are also described along the way, but in less detail.
Techniques from many different areas in mathematics are needed to analyze these problems. These areas include combinatorics, probability theory, functional analysis, complex analysis, and the theory of integrable systems. The book is self-contained, and along the way we develop enough of the theory we need from each area that a general reader with, say, two or three years experience in graduate school can learn the subject directly from the text.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Jinho Baik, University of Michigan, Ann Arbor, MI, USA.
Percy Deift, Courant Institute, New York University, NY, USA.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 26719159
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. Series: Graduate Studies in Mathematics. Num Pages: 461 pages, illustrations. BIC Classification: PBD; PBT; PBV. Category: (G) General (US: Trade). Dimension: 428 x 188 x 30. Weight in Grams: 982. . 2016. Hardcover. . . . . N° de réf. du vendeur V9780821848418
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 461 pages. 10.25x7.50x1.25 inches. In Stock. N° de réf. du vendeur 0821848410
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 26719159-n
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. Series: Graduate Studies in Mathematics. Num Pages: 461 pages, illustrations. BIC Classification: PBD; PBT; PBV. Category: (G) General (US: Trade). Dimension: 428 x 188 x 30. Weight in Grams: 982. . 2016. Hardcover. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780821848418
Quantité disponible : 1 disponible(s)
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Hardcover. Etat : Gut. 461 S. Ex-library with stamp and library-signature in good condition, some traces of use. C-00694 9780821848418 Sprache: Englisch Gewicht in Gramm: 1050. N° de réf. du vendeur 2483219
Quantité disponible : 1 disponible(s)
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 26719159-n
Quantité disponible : 2 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
HRD. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FW-9780821848418
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. The goal of this book is to analyse in detail Ulam s problem for increasing subsequences of random permutations, and domino tilings of the Aztec diamond. Other examples are also described along the way, but in less detail. The book is self-contained, and de. N° de réf. du vendeur 874649339
Quantité disponible : 1 disponible(s)
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Hardback. Etat : New. New copy - Usually dispatched within 4 working days. N° de réf. du vendeur B9780821848418
Quantité disponible : 1 disponible(s)