Search arXivSearch

arXiv · 2309.05970

Coloured corner processes from asymptotics of LLT polynomials

Abstract

We consider probability measures arising from the Cauchy summation identity for the LLT (Lascoux--Leclerc--Thibon) symmetric polynomials of rank $n \geq 1$. We study the asymptotic behaviour of these measures as one of the two sets of polynomials in the Cauchy identity stays fixed, while the other one grows to infinity. At $n=1$, this corresponds to an analogous limit of the Schur process, which is known to be given by the Gaussian Unitary Ensemble (GUE) corners process. Our main result states that, for $n>1$, our measures asymptotically split into two parts: a continuous one and a discrete one. The continuous part is a product of $n$ GUE corners processes; the discrete part is an explicit finite distribution on interlacing $n$-colourings of $n$ interlacing triangles, which has weights that are rational functions in the LLT parameter $q$. The latter distribution has a number of interesting (partly conjectural) combinatorial properties, such as $q$-nonnegativity and enumerative phenomena underlying its support. Our main tools are two different representations of the LLT polynomials, one as partition functions of a fermionic lattice model of rank $n$, and the other as finite-dimensional contour integrals, which were recently obtained in arXiv:2012.02376, arXiv:2101.01605.

Explore related subjects

Keep this discovery

BibTeXRIS

Amol Aggarwal, Alexei Borodin, Michael Wheeler. 2023-09-12. Coloured corner processes from asymptotics of LLT polynomials. https://arxiv.org/abs/2309.05970

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR