{
  "id": "math/0209020",
  "version": "v1",
  "published": "2002-09-03T01:43:12.000Z",
  "updated": "2002-09-03T01:43:12.000Z",
  "title": "Computation in Coxeter groups II. Minimal roots",
  "authors": [
    "Bill Casselman"
  ],
  "categories": [
    "math.CO",
    "math.RT"
  ],
  "abstract": "In 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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2002-09-03T01:43:12.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05-04"
    ],
    "keywords": [
      "computation",
      "arbitrary coxeter groups",
      "efficient multiplication algorithm",
      "bob howlett",
      "brigitte brink"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2002math......9020C"
    }
  }
}