PyCox: Computing with (finite) Coxeter groups and Iwahori-Hecke algebras
Abstract
We introduce the computer algebra package {\sf PyCox}, written entirely in the {\sf Python} language. It implements a set of algorithms - in a spirit similar to the older {\sf 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 -graphs, which works efficiently for all finite groups of rank (except ). We also discuss the computation of Lusztig's leading coefficients of character values and distinguished involutions (which works for as well). Our experiments suggest a re-definition of Lusztig's "special" representations which, conjecturally, should also apply to the unequal parameter case.
Keywords
Cite
@article{arxiv.1201.5566,
title = {PyCox: Computing with (finite) Coxeter groups and Iwahori-Hecke algebras},
author = {Meinolf Geck},
journal= {arXiv preprint arXiv:1201.5566},
year = {2019}
}
Comments
26 pages; the second version contains minor corrections