Computation in Coxeter groups. I: Multiplication (Q1601111)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1757091
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computation in Coxeter groups. I: Multiplication |
scientific article; zbMATH DE number 1757091 |
Statements
Computation in Coxeter groups. I: Multiplication (English)
0 references
1 July 2002
0 references
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.
0 references
algorithms
0 references
Coxeter groups
0 references
products
0 references
roots
0 references
reflections
0 references
0.9141248464584352
0 references
0.8127496242523193
0 references
0.8007943034172058
0 references
