Computing individual Kazhdan-Lusztig basis elements.

DOI10.1016/J.JSC.2015.05.003MaRDI QIDQ491269zbMATH OpenOpenAlexFDO

Authors Leonard L. Scott, Timothy Sprowl

Publication date 24 August 2015

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1309.7265

zbMATH Keywords

Coxeter groupsKazhdan-Lusztig polynomials1-cohomologyHecke algebra basesrecursion avoiding algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Hecke algebras and their representations (20C08) Representation theory for linear algebraic groups (20G05) Cohomology theory for linear algebraic groups (20G10)

Abstract: In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm which, for Coxeter group elements of long length, generally involves computing most basis elements corresponding to Coxeter group elements of smaller length. Thus, many calculations simply compute all basis elements associated to a given length or less, even if the interest is in a specific Kazhdan-Lusztig basis element. Similar remarks apply to "parabolic" versions of these basis elements defined later by Deodhar (1987,1990), though the lengths involved are the (smaller) lengths of distinguished coset representatives. We give an algorithm which targets any given Kazhdan-Lusztig basis element or parabolic analog and does not precompute any other Kazhdan-Lusztig basis elements. In particular it does not have to store them. This results in a considerable saving in memory usage, enabling new calculations in an important case (for finite and algebraic group 1-cohomology with irreducible coefficients) analyzed by Scott-Xi (2010).

Recommendations

• On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras
• Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups
• Computation of Kazhdan-Lusztig polynomials and some applications to finite groups
• A combinatorial setting for questions in Kazhdan-Lusztig theory
• \(\mathsf{PyCox}\): computing with (finite) Coxeter groups and Iwahori-Hecke algebras.

Cites work

• scientific article; zbMATH DE number 4015004 (Why is no real title available?)
• A combinatorial setting for questions in Kazhdan-Lusztig theory
• Duality in parabolic set up for questions in Kazhdan-Lusztig theory
• First cohomology groups of Chevalley groups in cross characteristic.
• On some geometric aspects of Bruhat orderings. II: The parabolic analogue of Kazhdan-Lusztig polynomials
• Reduced standard modules and cohomology
• Representations of Coxeter groups and Hecke algebras
• Some new examples in 1-cohomology
• Some non-trivial Kazhdan-Lusztig coefficients of an affine Weyl group of type \(\widetilde A_n\).

Cited in

(9)

• On the computation of Kazhdan-Lusztig polynomials and representations of Hecke algebras
• Cohomology and Ext for blocks whose Brauer trees are lines or stars
• Computation of Kazhdan-Lusztig polynomials and some applications to finite groups
• Bounding cohomology for finite groups and Frobenius kernels.
• scientific article; zbMATH DE number 6127030 (Why is no real title available?)
• Generalized Jones traces and Kazhdan-Lusztig bases.
• Bounding the dimensions of rational cohomology groups.
• Remarks on the theory of \(W\)-graph ideals
• Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups

This page was built for publication: Computing individual Kazhdan-Lusztig basis elements.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491269)