Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-15T15:43:08.737Z Has data issue: false hasContentIssue false

PyCox: computing with (finite) Coxeter groups and Iwahori–Hecke algebras

Published online by Cambridge University Press:  01 August 2012

Meinolf Geck*
Affiliation:
Institute of Mathematics, University of Aberdeen, Aberdeen AB24 3UE, United Kingdom (email: m.geck@abdn.ac.uk)

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We introduce the computer algebra package PyCox, written entirely in the Python language. It implements a set of algorithms, in a spirit similar to the older CHEVIE system, for working with Coxeter groups and Hecke algebras. This includes a new variation of the traditional algorithm for computing Kazhdan–Lusztig cells and W-graphs, which works efficiently for all finite groups of rank ≤8 (except E8). We also discuss the computation of Lusztig’s leading coefficients of character values and distinguished involutions (which works for E8 as well). Our experiments suggest a re-definition of Lusztig’s ‘special’ representations which, conjecturally, should also apply to the unequal parameter case. Supplementary materials are available with this article.

Information

Type
Research Article
Copyright
Copyright © London Mathematical Society 2012
Supplementary material: File

Geck Supplementary Material

Supplementary Material

Download Geck Supplementary Material(File)
File 538.8 KB