PyCox: Computing with (finite) Coxeter groups and Iwahori-Hecke algebras

Abstract

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…