Skip to main navigation Skip to search Skip to main content

On the complexity of multiplication in the Iwahori–Hecke algebra of the symmetric group

  • RWTH Aachen University
  • The University of Western Australia

Research output: Contribution to a Journal (Peer & Non Peer)Articlepeer-review

Abstract

We present new efficient data structures for elements of Coxeter groups of type Am and their associated Iwahori–Hecke algebras H(Am). Usually, elements of H(Am) are represented as simple coefficient list of length M=(m+1)! with respect to the standard basis, indexed by the elements of the Coxeter group. In the new data structure, elements of H(Am) 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 H(Am).

Original languageEnglish
Pages (from-to)817-832
Number of pages16
JournalJournal of Symbolic Computation
Volume80
DOIs
Publication statusPublished - 1 May 2017

Keywords

  • Complexity
  • Finite Coxeter group
  • Iwahori–Hecke algebra
  • Symmetric group

Fingerprint

Dive into the research topics of 'On the complexity of multiplication in the Iwahori–Hecke algebra of the symmetric group'. Together they form a unique fingerprint.

Cite this