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}\)
From MaRDI portal
Publication:1633382
DOI10.1016/j.jcta.2018.11.010zbMath1401.05302arXiv1412.7040OpenAlexW2290404304MaRDI QIDQ1633382
Robert D. Gray, António Malheiro, Alan J. Cain
Publication date: 19 December 2018
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.7040
Combinatorial aspects of representation theory (05E10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (5)
Super jeu de taquin and combinatorics of super tableaux of type A ⋮ Knuth's coherent presentations of plactic monoids of type A ⋮ Coherence for plactic monoids via rewriting theory and crystal structures ⋮ Crystals and trees: quasi-Kashiwara operators, monoids of binary trees, and Robinson-Schensted-type correspondences ⋮ Tropical representations and identities of plactic monoids
Cites Work
- Plactic algebra of rank 3
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Crystal bases for the quantum queer superalgebra
- A plactic algebra for semisimple Lie algebras
- Synchronized rational relations of finite and infinite words
- Small cancellation theory and automatic groups
- Noncommutative Schubert polynomials
- \(B_2\)-crystals: axioms, structure, models
- Schubert polynomials and the Littlewood-Richardson rule
- A q-difference analogue of \(U({\mathfrak g})\) and the Yang-Baxter equation
- On crystal bases of the \(q\)-analogue of universal enveloping algebras
- On Schensted's construction and the multiplication of Schur functions
- Crystal bases and tensor product decompositions of \(U_ q(G_ 2)\)- modules
- Crystal graphs for representations of the \(q\)-analogue of classical Lie algebras
- A finiteness condition for rewriting systems
- Schensted-type correspondence, plactic monoid, and jeu de taquin for type \(C_n\)
- Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
- Schensted-type correspondences and plactic monoids for types \(B_n\) and \(D_n\)
- Plactic algebras.
- Automatic semigroups
- Crystal graphs and Young tableaux
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- Identities of the plactic monoid.
- Crystal base and a generalization of the Littlewood-Richardson rule for the classical Lie algebras
- On the local structure of doubly laced crystals
- Finite transducers for divisibility monoids
- Finitely generated algebras defined by homogeneous quadratic monomial relations and their underlying monoids.
- Set-theoretic solutions of the Yang-Baxter equation, RC-calculus, and Garside germs.
- Permutations, matrices, and generalized Young tableaux
- Crystalizing the q-analogue of universal enveloping algebras
- Crystal bases for the quantum queer superalgebra and semistandard decomposition tableaux
- Artin groups of large type are shortlex automatic with regular geodesics
- Gröbner bases for quadratic algebras of skew type
- On the semiprimitivity of finitely generated algebras
- Deciding conjugacy in sylvester monoids and other homogeneous monoids
- Singular Artin Monoids of Finite Coxeter Type Are Automatic
- Longest Increasing and Decreasing Subsequences
- Finite convergent presentation of plactic monoid for type C
- Crystal bases and combinatorics of infinite rank quantum groups
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
- On the Homology of Associative Algebras
- La correspondance de Robinson
- A symplectic jeu de taquin bijection between the tableaux of King and of De Concini
- String rewriting and homology of monoids
- A local characterization of simply-laced crystals
- CRYSTAL BASES FOR QUANTUM AFFINE ALGEBRAS AND COMBINATORICS OF YOUNG WALLS
- Term Rewriting and All That
- THE CHINESE MONOID
- Semigroup and Group Presentations
- Automatic monoids and change of generators
- Crystal bases for the quantum superalgebra $U_q(\mathfrak {gl}(m,n))$
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
- Fundamentals of Computation Theory
- The shifted plactic monoid
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: 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}\)
