Computation in Coxeter groups II. Minimal roots

Simple item page
dc.creatorCasselman, Bill
dc.date2002-09-03
dc.date.accessioned2026-07-07T04:50:33Z
dc.date.available2026-07-07T04:50:33Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/math/0209020
dc.identifierhttp://arxiv.org/abs/math/0209020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/64832
dc.subjectCombinatorics
dc.subjectRepresentation Theory
dc.subject05-04
dc.titleComputation in Coxeter groups II. Minimal roots
dc.typetext

Files

Collections

arXiv