Macdonald law of large numbers for row and column lengths

From papers

Let q,t[0,1)q,t\in[0,1) be Macdonald parameters, and let λ(n)\lambda(n) be a random Young diagram distributed according to the Macdonald measure Mnα;β;Plγ\mathscr M_n^{\boldsymbol\alpha;\boldsymbol\beta;\mathbf{Pl}_\gamma}. Write λi(n)\lambda_i(n) for its row lengths and λi(n)\lambda_i'(n) for its column lengths.

Macdonald law-of-large-numbers conjecture. With almost sure convergence,

λi(n)nαi,λi(n)nβi1q1t,i=1,2,.\frac{\lambda_i(n)}{n}\to\alpha_i, \qquad \frac{\lambda_i'(n)}{n}\to\beta_i\frac{1-q}{1-t}, \qquad i=1,2,\ldots.

This extends the Hall--Littlewood law of large numbers from one Macdonald specialization to the two-parameter Macdonald setting. The source presents it as a conjectural analogue of the proved Hall--Littlewood result.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Alexey Bufetov and Leonid Petrov, “Law of Large Numbers for Infinite Random Matrices over a Finite Field”, arXiv:1402.1772 (2015).

Solutions 0

No solutions have been posted yet.