Computation in Coxeter groups II. Constructing minimal roots
From MaRDI portal
Abstract: In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that paper I discussed how this algorithm could be used to build the reflection table of minimal roots, which could in turn form the basis of a much more efficient multiplication algorithm. In this paper, following a suggestion of Bob Howlett, I explain how results due to Brigitte Brink can be used to construct the minimal root reflection table directly and more efficiently.
Recommendations
Cites work
Cited in
(9)- A transducer approach to Coxeter groups
- Computation in Coxeter groups. I: Multiplication
- Actions of the hyperoctahedral group to compute minimal contractors
- Automata, reduced words and Garside shadows in Coxeter groups.
- Nonorthogonal geometric realizations of Coxeter groups.
- Elementary roots and admissible subsets of Coxeter groups
- On paired root systems of Coxeter groups
- scientific article; zbMATH DE number 845627 (Why is no real title available?)
- Bender-Knuth billiards in Coxeter groups
This page was built for publication: Computation in Coxeter groups II. Constructing minimal roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614514)