Coxeter systems for which the Brink-Howlett automaton is minimal
DOI10.1016/J.JALGEBRA.2019.02.014zbMATH Open1467.20024arXiv1811.06759OpenAlexW2964138975WikidataQ128344491 ScholiaQ128344491MaRDI QIDQ1732907FDOQ1732907
Authors: Xianqiang Yang
Publication date: 25 March 2019
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06759
Recommendations
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)
Cites Work
- Combinatorics of Coxeter Groups
- Buildings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The set of dominance-minimal roots
- A finiteness property and an automatic structure for Coxeter groups
- Garside families in Artin-Tits monoids and low elements in Coxeter groups.
- Automata, reduced words and Garside shadows in Coxeter groups.
- Small roots, low elements, and the weak order in Coxeter groups
- Reflection subgroups of finite and affine Weyl groups.
- Groups, languages and automata
Cited In (2)
This page was built for publication: Coxeter systems for which the Brink-Howlett automaton is minimal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732907)