• DOI:10.1007/S00029-015-0179-9
• Corpus ID: 119719617

Law of Large Numbers for infinite random matrices over a finite field

@article{Bufetov2014LawOL,
  title={Law of Large Numbers for infinite random matrices over a finite field},
  author={Alexey Bufetov and Leonid Petrov},
  journal={Selecta Mathematica},
  year={2014},
  volume={21},
  pages={1271-1338}
}

• Alexey Bufetov, L. Petrov
• Published 7 February 2014
• Mathematics
• Selecta Mathematica

Asymptotic representation theory of general linear groups $$\hbox {GL}(n,F_\mathfrak {q})$$GL(n,Fq) over a finite field leads to studying probability measures $$\rho $$ρ on the group $$\mathbb {U}$$U of all infinite uni-uppertriangular matrices over $$F_\mathfrak {q}$$Fq, with the condition that $$\rho $$ρ is invariant under conjugations by arbitrary infinite matrices. Such probability measures form an infinite-dimensional simplex, and the description of its extreme points (in other words, ergodic measures $$\rho $$ρ) was conjectured by Kerov in connection with nonnegative specializations of Hall–Littlewood symmetric functions. Vershik and Kerov also conjectured the following Law of Large Numbers. Consider an infinite random matrix drawn from an ergodic measure coming from the Kerov’s conjectural classification and its $$n \times n$$n×n submatrix formed by the first rows and columns. The sizes of Jordan blocks of the submatrix can be interpreted as a (random) partition of $$n$$n, or, equivalently, as a (random) Young diagram $$\lambda (n)$$λ(n) with $$n$$n boxes. Then, as $$n\rightarrow \infty $$n→∞, the rows and columns of $$\lambda (n)$$λ(n) have almost sure limiting frequencies corresponding to parameters of this ergodic measure. Our main result is the proof of this Law of Large Numbers. We achieve it by analyzing a new randomized Robinson–Schensted–Knuth (RSK) insertion algorithm which samples random Young diagrams $$\lambda (n)$$λ(n) coming from ergodic measures. The probability weights of these Young diagrams are expressed in terms of Hall–Littlewood symmetric functions. Our insertion algorithm is a modified and extended version of a recent construction by Borodin and Petrov (2013). On the other hand, our randomized RSK insertion generalizes a version of the RSK insertion introduced by Vershik and Kerov (SIAM J. Algebr. Discret. Math. 7(1):116–124, 1986) in connection with asymptotic representation theory of symmetric groups (which is governed by nonnegative specializations of Schur symmetric functions).