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

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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).

Cite

CITATION STYLE

APA

Niemeyer, A. C., Pfeiffer, G., & Praeger, C. E. (2017). On the complexity of multiplication in the Iwahori–Hecke algebra of the symmetric group. Journal of Symbolic Computation, 80, 817–832. https://doi.org/10.1016/j.jsc.2016.09.001

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free