Computation in Coxeter groups II. Minimal roots
Bill Casselman
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.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.