arXiv · 1201.5566
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 $W$-graphs, which works efficiently for all finite groups of rank $\leq 8$ (except $E_8$). We also discuss the computation of Lusztig's leading coefficients of character values and distinguished involutions (which works for $E_8$ as well). Our experiments suggest a re-definition of Lusztig's "special" representations which, conjecturally, should also apply to the unequal parameter case.
Explore related subjects
Keep this discovery
Meinolf Geck. 2012-01-26. PyCox: Computing with (finite) Coxeter groups and Iwahori-Hecke algebras. https://doi.org/10.1112/s1461157012001064
Cite the original work for its findings. Save a collection to share your selection of sources.