Chinese syzygies by insertions

DOI10.1007/S00233-021-10244-4MaRDI QIDQ2070976zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

syzygiesChinese monoidsstring rewritinginsertion algorithmsChinese staircases

Mathematics Subject Classification ID

Semigroups (20Mxx)

Recommendations

• THE CHINESE MONOID
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
• Tropical representations of Chinese monoids with and without involution
• Finite derivation type property on the Chinese monoid.
• Tropical linear representations of the Chinese monoid

Cites work

• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 5759428 (Why is no real title available?)
• scientific article; zbMATH DE number 3817997 (Why is no real title available?)
• scientific article; zbMATH DE number 1047928 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 789389 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• A finiteness condition for rewriting systems
• Algebraic and combinatorial structures on pairs of twin binary trees
• Coherent presentations of Artin monoids
• Commutative combinatorial Hopf algebras.
• Conditioned random walks and the RSK correspondence
• GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID
• Higher-dimensional normalisation strategies for acyclicity
• Identities among relations for higher-dimensional rewriting systems
• Irreducible representations of the Chinese monoid
• Knuth's coherent presentations of plactic monoids of type A
• Longest Increasing and Decreasing Subsequences
• Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm
• On the hypoplactic monoid
• Permutations, matrices, and generalized Young tableaux
• Polygraphs of finite derivation type
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
• 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\)
• THE CHINESE MONOID
• The algebra of binary search trees
• The monoids of the patience sorting algorithm

Cited in

(5)

• Coherent confluence modulo relations and double groupoids
• Algebraic coherent confluence and higher globular Kleene algebras
• Coherence for plactic monoids via rewriting theory and crystal structures
• Chinese syzygies by insertions
• Super jeu de taquin and combinatorics of super tableaux of type A

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)