Coxeter systems for which the Brink-Howlett automaton is minimal

DOI10.1016/j.jalgebra.2019.02.014zbMath1467.20024arXiv1811.06759OpenAlexW2964138975WikidataQ128344491 ScholiaQ128344491MaRDI QIDQ1732907

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

zbMATH Keywords

Coxeter groupsautomataroot systemsreduced wordsCoxeter graphsmall rootselementary rootscone types

Mathematics Subject Classification ID

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 (1)

Cone types, automata, and regular partitions in Coxeter groups

Cites Work

• Automata, reduced words and Garside shadows in Coxeter groups.
• Small roots, low elements, and the weak order in Coxeter groups
• 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.
• Groups, Languages and Automata
• Combinatorics of Coxeter Groups
• Reflection subgroups of finite and affine Weyl groups
• Buildings
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coxeter systems for which the Brink-Howlett automaton is minimal