Computational construction of irreducible W-graphs for types E₆ and E₇.

DOI10.1016/J.JALGEBRA.2008.12.018MaRDI QIDQ1024377zbMATHOpenAlexFDO

Authors R. B. Howlett, Yunchuan Yin

Publication date 17 June 2009

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgebra.2008.12.018

zbMATH Keywords

irreducible representationsHecke algebrascharacter tablesfinite Coxeter groupsMagmaKazhdan-Lusztig cells\(W\)-graphs

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55) Hecke algebras and their representations (20C08)

Recommendations

• IrreducibleW-Graphs for TypeD₄andD₅
• \(W\)-Graphs and Gyoja's \(W\)-graph algebra
• Computational Construction of W-graphs of Heeke algebras H(q, n) for nup to 15
• On the existence of a W-graph for an irreducible representation of a Coxeter group
• \(W\)-graph ideals.

Cites work

• Inducing \(W\)-graphs.
• IrreducibleW-Graphs for TypeD₄andD₅
• On the existence of a W-graph for an irreducible representation of a Coxeter group
• Representations of Coxeter groups and Hecke algebras
• Some characterizations of Bruhat ordering on a Coxeter group and determination of the relation Möbius function
• The classes and representations of the groups of 27 lines and 28 bitangents

Cited in

(10)

• On the Kazhdan-Lusztig cells in type \(E_8\).
• \(W\)-Graphs and Gyoja's \(W\)-graph algebra
• Inducing \(W\)-graphs. II.
• IrreducibleW-Graphs for TypeD₄andD₅
• Type \(A\) admissible cells are Kazhdan-Lusztig
• On the existence of a W-graph for an irreducible representation of a Coxeter group
• \(\mathsf{PyCox}\): computing with (finite) Coxeter groups and Iwahori-Hecke algebras.
• Invariant bilinear forms on \(W\)-graph representations and linear algebra over integral domains
• Remarks on the theory of \(W\)-graph ideals
• scientific article; zbMATH DE number 2115447 (Why is no real title available?)

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Computational construction of irreducible \(W\)-graphs for types \(E_6\) and \(E_7\).

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