Related papers: Schensted-type correspondence, plactic monoid and …
We use Kashiwara's theory of crystal bases to study plactic monoids for $U_{q}(so_{2n+1})$ and $U_{q}(so_{2n})$. Simultaneously we describe a Schensted type correspondence in the crystal graphs of tensor powers of vector and spin…
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.…
We study the four plactic-like monoids that arise by taking the meets and joins of stalactic and taiga congruences. We obtain the combinatorial objects associated with the meet monoids, establishing Robinson-Schensted-like correspondences…
Rewriting methods have been developed for the study of coherence for algebraic objects. This consists in starting with a convergent presentation, and expliciting a family of generating confluences to obtain a coherent presentation -- one…
The vertices of any (combinatorial) Kashiwara crystal graph carry a natural monoid structure given by identifying words labelling vertices that appear in the same position of isomorphic components of the crystal. Working on a purely…
We provide an explicit combinatorial description of the embedding of the crystal of Kashiwara-Nakashima tableaux in types $B$ and $C$ into that of $\bi$-Lusztig data associated to a family of reduced expressions $\bi$ of the longest element…
We describe the embedding from the crystal of Kashiwara-Nakashima tableaux in type $D$ of an arbitrary shape into that of $\mathbf{i}$-Lusztig data associated to a family of reduced expressions $\mathbf{i}$ which are compatible with the…
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Sch\"{u}tzenberger's jeu de taquin on the…
This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…
Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid $\mathbf{Pl}$, called \emph{plactic}. It is central in numerous combinatorial and algebraic applications. In this paper, the tableaux…
We give an explicit presentation for the plactic monoid for type C using admissible column generators. Thanks to the combinatorial properties of symplectic tableaux, we prove that this presentation is finite and convergent. We obtain as a…
We present a Robinson-Schensted-Knuth type one-to-one correspondence between the set of pictures and the set of pairs of Littlewood-Richardson crystals.
In the recent papers with Masaki Kashiwara, the author introduced the notion of symmetric crystals and presented the Lascoux-Leclerc-Thibon-Ariki type conjectures for the affine Hecke algebras of type $B$. Namely, we conjectured that…
This technical report investigates Kripke-style modal type theories, both simply typed and dependently typed. We examine basic meta-theories of the type theories, develop their substitution calculi, and give normalization by evaluation…
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…
The cyclic shift graph of a monoid is the graph whose vertices are the elements of the monoid and whose edges connect elements that are cyclic shift related. The Patience Sorting algorithm admits two generalizations to words, from which two…
We are interested in the structure of the crystal graph of level $l$ Fock spaces representations of $\mathcal{U}_q (\widehat{\mathfrak{sl}_e})$. Since the work of Shan [26], we know that this graph encodes the modular branching rule for a…
We study the Steinberg variety associated to matrix Schubert varieties, and develop a Robinson-Schensted type correspondence, $\tau\leftrightarrow(\Lambda,\mathsf Q,\mathsf P)$. Here $\tau$ is a partial permutation of size $p\times q$,…
Let u be a word over the positive integers. Motivated in part by a question from representation theory, we study the centralizer set of u which is C(u) = {w | uw is Knuth-equivalent to wu}. In particular, we give various necessary…
We give a new bijective interpretation of the Cauchy identity for Schur operators which is a commutation relation between two formal power series with operator coefficients. We introduce a plactic algebra associated with the Kashiwara's…