Computation in Coxeter groups. I: Multiplication
type: Item
instance of: scholarly article
title: Computation in Coxeter groups. I: Multiplication
zbMATH Open document ID: 0996.20026
published in: The Electronic Journal of Combinatorics
publication date: 2002-07-01T00:00:00Z
full work available at URL: https://eudml.org/doc/122100
full work available at URL: v9i1r25.html
review text: 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.
Mathematics Subject Classification ID: 20F55
Mathematics Subject Classification ID: 20-04
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 1757091
zbMATH Keywords: algorithms
zbMATH Keywords: Coxeter groups
zbMATH Keywords: products
zbMATH Keywords: roots
zbMATH Keywords: reflections
author: Bill Casselman
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1757091