ﻻ يوجد ملخص باللغة العربية
We introduce an object called a decorated Young tableau which can equivalently be viewed as a continuous time trajectory of Young diagrams or as a non-intersecting line ensemble. By a natural extension of the Robinson-Schensted correspondence, we create a random pair of decorated Young tableaux from a Poisson point process in the plane, which we think of as a stochastic process in discrete space and continuous time. By using only elementary techniques and combinatorial properties, we identify this process as a Schur process and show it has the same law as certain non-intersecting Poisson walkers.
By using an elementary matrix approach, based on the technique of discrete Toda equation, we construct subtraction-free rational and piecewise linear transformations associated with various combinatorial algorithms, including the RSK correspondence.
We formalize some known categorical equivalences to give a rigorous treatment of smooth representations of p-adic general linear groups, as ungraded modules over quiver Hecke algebras of type A. Graded variants of RSK-standard modules are construct
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of $1$-minors.
Katos exotic nilpotent cone was introduced as a substitute for the ordinary nilpotent cone of type C with cleaner properties. The geometric Robinson-Schensted correspondence is obtained by parametrizing the irreducible components of the Steinberg var
In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice path interpre