Search arXivSearch

arXiv · 1911.08143

Second class particles and limit shapes of evacuation and sliding paths for random tableaux

Abstract

We investigate two closely related setups. In the first one we consider a TASEP-style system of particles with specified initial and final configurations. The probability of each history of the system is assumed to be equal. We show that the rescaled trajectory of the \emph{second class particle} converges (as the size of the system tends to infinity) to a random arc of an ellipse. In the second setup we consider a uniformly random Young tableau of square shape and look for typical (in the sense of probability) sliding paths and evacuation paths in the asymptotic setting as the size of the square tends to infinity. We show that the probability distribution of such paths converges to a random meridian connecting the opposite corners of the square. We also discuss analogous results for non-square Young tableaux.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Łukasz Maślanka, Piotr Śniady. 2022-03-23. Second class particles and limit shapes of evacuation and sliding paths for random tableaux. https://doi.org/10.25537/dm.2022v27.2183-2273

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO