Computation in Coxeter groups. I: Multiplication
From MaRDI portal
Publication:1601111
Summary: An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and the author. Proofs are largely based on geometry. The algorithm has been implemented in practical Java programs, and runs surprisingly quickly. It seems to be good enough in many interesting cases to build the minimal root reflection table of Brink and Howlett, which can be used for a more efficient multiplication routine.
Recommendations
Cited in
(16)- A transducer approach to Coxeter groups
- Machine calculations in Weyl groups
- Vanishing cycles and Cartan eigenvectors
- On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group
- On the values of unipotent characters of finite Chevalley groups of type \(E_7\) in characteristic 2
- Automata, reduced words and Garside shadows in Coxeter groups.
- Root systems for asymmetric geometric representations of Coxeter groups.
- CoxIter -- computing invariants of hyperbolic Coxeter groups.
- Computation in Coxeter groups II. Constructing minimal roots
- scientific article; zbMATH DE number 20332 (Why is no real title available?)
- scientific article; zbMATH DE number 22908 (Why is no real title available?)
- scientific article; zbMATH DE number 1757341 (Why is no real title available?)
- On paired root systems of Coxeter groups
- A conjecture on Whittaker-Fourier coefficients of cusp forms
- scientific article; zbMATH DE number 845627 (Why is no real title available?)
- Coxeter element and particle masses
This page was built for publication: Computation in Coxeter groups. I: Multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601111)