Automata, reduced words and Garside shadows in Coxeter groups.
DOI10.1016/j.jalgebra.2016.04.006zbMath1346.20053arXiv1510.01607OpenAlexW2962801181MaRDI QIDQ279744
F. Blanchet-Sadri, M. Dambrine
Publication date: 29 April 2016
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.01607
Coxeter groupsfinite automatareduced wordsdominance orderGarside shadowslow elementssmall rootsweak order
Formal languages and automata (68Q45) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (6)
Uses Software
Cites Work
- The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
- The Kazhdan-Lusztig cells in certain affine Weyl groups
- The set of dominance-minimal roots
- A finiteness property and an automatic structure for Coxeter groups
- Machine calculations in Weyl groups
- Computation in Coxeter groups. I: Multiplication
- Coxeter groups are almost convex
- The dominance hierarchy in root systems of Coxeter groups.
- Foundations of Garside theory
- Garside families in Artin-Tits monoids and low elements in Coxeter groups.
- Combinatorics of Coxeter Groups
- Computation in Coxeter groups II. Constructing minimal roots
- Asymptotical Behaviour of Roots of Infinite Coxeter Groups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automata, reduced words and Garside shadows in Coxeter groups.