No Arabic abstract
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 also investigate birational Weyl group actions related to those algorithms.
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 constructed for quiver Hecke algebras. Exporting recent results from the p-adic setting, we describe an effective method for construction and classification of all simple modules as quotients of modules induced from maximal homogenous data. It is established that the products involved in the RSK construction fit the Kashiwara-Kim notion of normal sequences of real modules. We deduce that RSK-standard modules have simple heads, devise a formula for the shift of grading between RSK-standard and simple self-dual modules, and establish properties of their decomposition matrix, thus confirming expectations for p-adic groups raised in a work of the author with Lapid. Subsequent work will exhibit how the presently introduced RSK construction generalizes the much-studied Specht construction, when inflated from cyclotomic quotient algebras.
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 variety (the conormal variety for the action of a semisimple group on two copies of its flag variety); in type A the bijection coincides with the classical Robinson-Schensted algorithm for the symmetric group. Here we give a combinatorial description of the bijection obtained by using the exotic nilpotent cone instead of ordinary type C nilpotent cone in the geometric Robinson-Schensted correspondence; we refer this as the exotic Robinson-Schensted bijection. This is interesting from a combinatorial perspective, and not a naive extension of the type A Robinson-Schensted bijection.
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 interpretation of the standard Young tableaux but also reveals an unexpected intrinsic relation between the set of SYTs with at most $2d+1$ rows and the set of SYTs with at most 2d rows.