Chinese syzygies by insertions
From MaRDI portal
Publication:2070976
DOI10.1007/s00233-021-10244-4OpenAlexW4205814687MaRDI QIDQ2070976
Publication date: 25 January 2022
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.09879
Related Items (4)
Coherent confluence modulo relations and double groupoids ⋮ Algebraic coherent confluence and higher globular Kleene algebras ⋮ Super jeu de taquin and combinatorics of super tableaux of type A ⋮ Coherence for plactic monoids via rewriting theory and crystal structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Irreducible representations of the Chinese monoid
- Higher-dimensional normalisation strategies for acyclicity
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
- The algebra of binary search trees
- Commutative combinatorial Hopf algebras.
- A finiteness condition for rewriting systems
- Schensted-type correspondence, plactic monoid, and jeu de taquin for type \(C_n\)
- Schensted-type correspondences and plactic monoids for types \(B_n\) and \(D_n\)
- Knuth's coherent presentations of plactic monoids of type A
- Algebraic and combinatorial structures on pairs of twin binary trees
- On the hypoplactic monoid
- Permutations, matrices, and generalized Young tableaux
- Identities among relations for higher-dimensional rewriting systems
- Polygraphs of finite derivation type
- Longest Increasing and Decreasing Subsequences
- GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID
- Conditioned random walks and the RSK correspondence
- The monoids of the patience sorting algorithm
- THE CHINESE MONOID
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
- Coherent presentations of Artin monoids
This page was built for publication: Chinese syzygies by insertions
