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.











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)