Sciweavers

Share
COMBINATORICS
2002

Computation in Coxeter Groups-I. Multiplication

10 years 11 months ago
Computation in Coxeter Groups-I. Multiplication
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. 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. MR subject classifications: 20H15, 20-04
Bill Casselman
Related Content
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2002
Where COMBINATORICS
Authors Bill Casselman
Comments (0)
books