Chinese syzygies by insertions
From MaRDI portal
Publication:2070976
DOI10.1007/S00233-021-10244-4OpenAlexW4205814687MaRDI QIDQ2070976FDOQ2070976
Authors: Nohra Hage, Philippe Malbos
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
Recommendations
Cites Work
- Permutations, matrices, and generalized Young tableaux
- Longest Increasing and Decreasing Subsequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
- Commutative combinatorial Hopf algebras.
- Title not available (Why is that?)
- Polygraphs of finite derivation type
- The algebra of binary search trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irreducible representations of the Chinese monoid
- Conditioned random walks and the RSK correspondence
- THE CHINESE MONOID
- GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID
- A finiteness condition for rewriting systems
- Algebraic and combinatorial structures on pairs of twin binary trees
- Schensted-type correspondences and plactic monoids for types \(B_n\) and \(D_n\)
- Identities among relations for higher-dimensional rewriting systems
- Higher-dimensional normalisation strategies for acyclicity
- Title not available (Why is that?)
- Coherent presentations of Artin monoids
- Schensted-type correspondence, plactic monoid, and jeu de taquin for type \(C_n\)
- On the hypoplactic monoid
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
- Knuth's coherent presentations of plactic monoids of type A
- The monoids of the patience sorting algorithm
Cited In (5)
This page was built for publication: Chinese syzygies by insertions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070976)