On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group
From MaRDI portal
Publication:1711997
Abstract: We present new efficient data structures for elements of Coxeter groups of type and their associated Iwahori--Hecke algebras . Usually, elements of are represented as simple coefficient list of length with respect to the standard basis, indexed by the elements of the Coxeter group. In the new data structure, elements of are represented as nested coefficient lists. While the cost of addition is the same in both data structures, the new data structure leads to a huge improvement in the cost of multiplication in~.
Recommendations
- Computation in Coxeter groups. I: Multiplication
- On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras
- Multiplicative bases for the centres of the group algebra and Iwahori-Hecke algebra of the symmetric group.
- The Hecke group algebra of a Coxeter group and its representation theory.
- scientific article; zbMATH DE number 1516227
Cites work
- scientific article; zbMATH DE number 1516227 (Why is no real title available?)
- scientific article; zbMATH DE number 1361790 (Why is no real title available?)
- CHEVIE -- A system for computing and processing generic character tables
- \(\mathsf{PyCox}\): computing with (finite) Coxeter groups and Iwahori-Hecke algebras.
Cited in
(3)
This page was built for publication: On the complexity of multiplication in the Iwahori-Hecke algebra of the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1711997)