THE CHINESE MONOID

DOI10.1142/S0218196701000425zbMath1024.20046OpenAlexW2022855289MaRDI QIDQ4786282

Julien Cassaigne, Jean-Christophe Novelli, Daniel Krob, Marc Espie, Florent Hivert

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196701000425

zbMATH Keywords

algorithmsplactic monoidChinese monoid

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial aspects of representation theory (05E10) Free semigroups, generators and relations, word problems (20M05)

Related Items (27)

Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) ⋮ Garside and Quadratic Normalisation: A Survey ⋮ Irreducible representations of the Chinese monoid ⋮ Involution words. II: Braid relations and atomic structures ⋮ Gröbner-Shirshov Bases for Plactic Algebras ⋮ Irreducible representations of the plactic algebra of rank four ⋮ Minimal spectrum and the radical of Chinese algebras. ⋮ Atoms for signed permutations ⋮ Deciding conjugacy in sylvester monoids and other homogeneous monoids ⋮ Algebras and groups defined by permutation relations of alternating type. ⋮ Tropical linear representations of the Chinese monoid ⋮ Equivalence classes of permutations modulo replacements between 123 and two-integer patterns ⋮ Structure of Chinese algebras. ⋮ Plactic algebra of rank 3 ⋮ Tropical plactic algebra, the cloaktic monoid, and semigroup representations ⋮ The monoids of the patience sorting algorithm ⋮ Involution Schubert-Coxeter combinatorics ⋮ Gröbner–Shirshov bases and their calculation ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Finitely presented algebras and groups defined by permutation relations. ⋮ GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID ⋮ Quadratic normalization in monoids ⋮ Chinese syzygies by insertions ⋮ Chinese Algebras of Rank 3 ⋮ Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids ⋮ Identities of the plactic monoid. ⋮ Identities and bases in the hypoplactic monoid

Cites Work

• An extension of Schensted's theorem
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• La correspondance de Robinson
• On the Representations of the Symmetric Group

This page was built for publication: THE CHINESE MONOID