Computational construction of irreducible W-graphs for types E₆ and E₇.
From MaRDI portal
(Redirected from Publication:1024377)
Computational construction of irreducible \(W\)-graphs for types \(E 6\) and \(E 7\).
Computational construction of irreducible \(W\)-graphs for types \(E 6\) and \(E 7\).
Recommendations
Cites work
- Inducing \(W\)-graphs.
- IrreducibleW-Graphs for TypeD4andD5
- 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₈.
- Invariant bilinear forms on W-graph representations and linear algebra over integral domains
- Type A admissible cells are Kazhdan-Lusztig
- \(\mathsf{PyCox}\): computing with (finite) Coxeter groups and Iwahori-Hecke algebras.
- On the existence of a W-graph for an irreducible representation of a Coxeter group
- IrreducibleW-Graphs for TypeD4andD5
- Remarks on the theory of W-graph ideals
- \(W\)-Graphs and Gyoja's \(W\)-graph algebra
- scientific article; zbMATH DE number 2115447 (Why is no real title available?)
- Inducing \(W\)-graphs. II.
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)