Coxeter systems for which the Brink-Howlett automaton is minimal
From MaRDI portal
(Redirected from Publication:1732907)
Abstract: In this article we classify the Coxeter systems for which the Brink-Howlett automaton is minimal. We show that this automaton is minimal if and only if each elementary root is supported on a standard spherical subsystem, thereby resolving a conjecture of Hohlweg, Nadeau and Williams.
Recommendations
Cites work
- scientific article; zbMATH DE number 1713119 (Why is no real title available?)
- scientific article; zbMATH DE number 47598 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- A finiteness property and an automatic structure for Coxeter groups
- Automata, reduced words and Garside shadows in Coxeter groups.
- Buildings
- Combinatorics of Coxeter Groups
- Garside families in Artin-Tits monoids and low elements in Coxeter groups.
- Groups, languages and automata
- Reflection subgroups of finite and affine Weyl groups.
- Small roots, low elements, and the weak order in Coxeter groups
- The set of dominance-minimal roots
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)