Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups

DOI10.1080/10586458.2002.10504482zbMath1101.20304OpenAlexW2010474410MaRDI QIDQ5472035

Fokko du Cloux

Publication date: 14 June 2006

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/1057777429

zbMATH Keywords

algorithmsCoxeter systemsKazhdan-Lusztig polynomialsCoxeter matricescomputational group theoryBruhat ordering

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Related Items (8)

Infrared computations of defect Schur indices ⋮ The size of Bruhat intervals between nested involutions in \(S_{n}\) ⋮ Modular intersection cohomology complexes on flag varieties ⋮ An effective decomposition theorem for Schubert varieties ⋮ Positivity conjectures for Kazhdan-Lusztig theory on twisted involutions: the finite case. ⋮ Rigidity of Schubert closures and invariance of Kazhdan-Lusztig polynomials. ⋮ Universal features of BPS strings in six-dimensional SCFTs ⋮ Computation of Kazhdan-Lusztig polynomials and some applications to finite groups

Uses Software

• Coxeter

Cites Work

• Reflection subgroups of Coxeter systems
• Representations of Coxeter groups and Hecke algebras
• A note on subgroups generated by reflections in Coxeter groups
• A transducer approach to Coxeter groups
• A finiteness property and an automatic structure for Coxeter groups
• An abstract model for Bruhat intervals
• Möbius inversion for the Bruhat ordering on a Weyl group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing Kazhdan-Lusztig Polynomials for Arbitrary Coxeter Groups