Kerov's central limit theorem for the Plancherel measure on Young diagrams

Simple item page
dc.creatorIvanov, Vladimir
dc.creatorOlshanski, Grigori
dc.date2003-04-01
dc.date.accessioned2026-07-07T04:56:32Z
dc.date.available2026-07-07T04:56:32Z
dc.descriptionConsider random Young diagrams with a fixed number n of boxes, where the probability distribution on diagrams is determined by the Plancherel measure. That is, the weight of a diagram is proportional to the squared dimension of the corresponding irreducible representation of the symmetric group S_n. As n goes to infinity, the boundary of the (suitably scaled) random diagram concentrates near a curve Omega (Logan-Shepp 1977, Vershik-Kerov 1977). In 1993, Kerov announced a central limit theorem describing Gaussian fluctuations of random diagrams around the limit shape Omega. Here we propose a reconstruction of his proof, largely based on Kerov's unpublished work notes (1999). We also discuss a striking similarity between Kerov's result and central limit theorems for random matrices (Diaconis-Shahshahani, Johansson).
dc.descriptionAMS-TeX, 49 pages, no figures
dc.identifierhttps://arxiv.org/abs/math/0304010
dc.identifierhttp://arxiv.org/abs/math/0304010
dc.identifierIn: S.Fomin, editor. Symmetric Functions 2001: Surveys of Developments and Perspectives (NATO Science Series II. Mathematics, Physics and Chemistry. Vol.74), Kluwer, 2002, pp. 93-151
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66957
dc.subjectCombinatorics
dc.subjectProbability
dc.subjectRepresentation Theory
dc.subject05E05 (Primary) 05E10, 20C30, 20C32, 60B10, 60B15 (Secondary)
dc.titleKerov's central limit theorem for the Plancherel measure on Young diagrams
dc.typetext

Files

Collections

arXiv