SearcharxivSearch

arXiv · 2607.24018

Jeu de taquin forests and the inverse infinite RSK correspondence

Abstract

The Plancherel-random infinite Young tableau arises from applying the infinite Robinson-Schensted-Knuth (RSK) correspondence to a sequence of i.i.d. random variables distributed uniformly on the unit interval [0,1]. Building on the isomorphism of dynamical systems established in prior work, we provide an explicit geometric characterization of the inverse map. Our approach makes use of a previously unexplored structure, the jeu de taquin forest on the infinite tableau, where edges connect boxes according to local comparison rules. We prove that each tree in this forest almost surely extends toward infinity with a well-defined asymptotic direction, establishing a canonical bijection between trees and values in the i.i.d. input sequence. The ordering is recovered through tree lifetimes under iterated jeu de taquin transformations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dan Romik, Piotr Śniady. 2026-07-27. Jeu de taquin forests and the inverse infinite RSK correspondence. https://arxiv.org/abs/2607.24018

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