SearcharxivSearch

arXiv · 2309.15235

Asymptotics of Bounded Lecture-Hall Tableaux

Abstract

We study weighted bounded \(n\)-lecture hall tableaux with bound \(t_n\) in the joint limit \(n,t_n\to\infty\) with \(t_n/n\to\alpha\in(0,\infty)\). Using their non-intersecting-path representation, we construct a Schur generating function adapted to this model and derive moment formulas for the limiting counting measures. When the normalized tail sums of the weights have a \(C^2\) macroscopic profile with negative derivative, the rescaled height functions converge in probability in \(L^1_{\mathrm{loc}}(\mathbb R\times(0,\alpha))\) to a deterministic limit shape whose complex slope satisfies a Burgers equation with an explicit source term. In the uniformly weighted model of \cite{SKN21}, the source term vanishes, proving Conjecture~6.1 of that work. Under an additional interval-structure assumption on the limiting bottom boundary, and only continuity and strict monotonicity of the tail profile, the unrescaled height fluctuations converge to the Gaussian free field in the sense of joint moments of horizontal polynomial observables. The method applies although the particle configurations are not Gelfand--Tsetlin patterns and the associated dimer model is not doubly periodic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

David Keating, Zhongyang Li, Istvan Prause. 2023-09-26. Asymptotics of Bounded Lecture-Hall Tableaux. https://arxiv.org/abs/2309.15235

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