Related papers: A note on a cyclotomic-friendly application of RSK

We continue work begun in \cite{ptab} which introduced \emph{perforated tableaux} as a combinatorial model for crystals of type $A_{n-1}$, emphasizing connections to the classical Robinson-Schensted-Knuth (RSK) correspondence and Lusztig…

For any Lie algebra of classical type or type $G_2$ we define a $K$-theoretic analog of Dunkl's elements, the so-called truncated {\it Ruijsenaars-Schneider-Macdonald elements}, $RSM$-elements for short, in the corresponding {\it…

In this paper we extend the Robinson-Schensted-Knuth (RSK) superinsertion algorithm to hook-multipartitions and derive the super Frobenius formula for the characters of cyclotomic Hecke algebras (Linear and Multilinear Algebra, DOI:…

Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the…

Let $R$ be a positively graded algebra over a field. We say that $R$ is Hilbert-cyclotomic if the numerator of its reduced Hilbert series has all of its roots on the unit circle. Such rings arise naturally in commutative algebra, numerical…

Crystal graphs, in the sense of Kashiwara, carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. In the particular case of the crystal graph…

Notes from a course at the ATM Workshop on Schubert Varieties, held at The Institute of Mathematical Sciences, Chennai, in November 2017. Various expansions of Schur functions, the Lindstr\"om-Gessel-Viennot lemma, semistandard Young…

In 1996, Stanley extended the classical Catalan arrangement and semiorder arrangement, which are called the Catalan-type arrangement $\mathcal{C}_{n,A}$ and the semiorder-type arrangement $\mathcal{C}_{n,A}^*$ in this paper. By establishing…

We review some algebraic and combinatorial structures that underlie models in the KPZ universality class.Emphasis is placed on the Robinson-Schensted-Knuth correspondence and its geometric lifting due to A.N.Kirillov. We present how these…

We consider two examples of a fully decodable combinatorial encoding of Bernoulli schemes: the encoding via Weyl simplices and the much more complicated encoding via the RSK (Robinson--Schensted--Knuth) correspondence. In the first case,…

We generalize the Robinson-Schensted-Knuth algorithm to the insertion of two row arrays of multisets. This generalization leads to new enumerative results that have representation theoretic interpretations as decompositions of centralizer…

We define skew Schubert polynomials to be normal form (polynomial) representatives of certain classes in the cohomology of a flag manifold. We show that this definition extends a recent construction of Schubert polynomials due to Bergeron…

Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.

We characterize the class of cycle decompositions that can achieve all Young tableau shapes (except the trivial ones with a single row or a single column) under the Robinson--Schensted--Knuth (RSK) correspondence, a property that we call…

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…

We prove a restriction of an analogue of the Robinson--Schensted--Knuth correspondence for semi-skyline augmented fillings, due to Mason, to multisets of cells of a staircase possibly truncated by a smaller staircase at the upper left end…

In this paper, we develop the Robinson-Schensted correspondence between the elements of the groups $G_{r}$ $(\mathbb{Z}_{p^{r}}\rtimes \mathbb{Z}^{*}_{p^{r}})$ and $SG_{r}$ $(\mathbb{Z}_{p^{r-1}}\rtimes \mathbb{Z}^{*}_{p^{r}})$, along with…

The Berele row-insertion is a symplectic analogue of the Schensted row-insertion. In the present paper, we provide it with a representation theoretical interpretation via the quantum symmetric pairs of type $A\mathrm{II}$. As applications,…

We use Kang-Misra's combinatorial description of the crystal graphs for $U_{q}(G_{2})$ to introduce the plactic monoid for type $G_{2}$. Then we describe the corresponding insertion algorithm which yields a Schensted type correspondence.…

Using symmetric function theory, we study the cycle structure and increasing subsequence structure of permutations after various shuffling methods, emphasizing the role of Cauchy type identities and the Robinson-Schensted-Knuth…