A finiteness theorem for W-graphs

DOI10.1016/J.AIM.2012.01.008zbMATH Open1237.05214OpenAlexW2003302778MaRDI QIDQ765654FDOQ765654

Authors: John R. Stembridge 

Publication date: 21 March 2012

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

Full work available at URL: https://doi.org/10.1016/j.aim.2012.01.008

Recommendations

• On Wiman's theorem for graphs
• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• scientific article; zbMATH DE number 963311
• A graph-theoretic approach to Wilf's conjecture
• Graph-wreath products and finiteness conditions
• A remark on the existence of finite graphs
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• On some cycles in Wenger graphs
• On the spectrum of Wenger graphs
• On the diameter of Wenger graphs

zbMATH Keywords

strongly regular graphcellKazhdanLusztig basisW-graph

Mathematics Subject Classification ID

Reflection and Coxeter groups (group-theoretic aspects) (20F55)

Cites Work

• Distance regular graphs of diameter 3 and strongly regular graphs
• Representations of Coxeter groups and Hecke algebras
• Title not available (Why is that?)
• A directed graph version of strongly regular graphs
• Admissible 𝑊-graphs

Cited In (8)

• Type \(A\) molecules are Kazhdan-Lusztig
• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• Type \(A\) admissible cells are Kazhdan-Lusztig
• On the existence of a W-graph for an irreducible representation of a Coxeter group
• Wiggles and finitely discontinuous \(k\)-to-1 functions between graphs
• Admissible 𝑊-graphs
• Some problems between a \(W\)-graph and its derived graphs
• Admissible \(W\)-graphs and commuting Cartan matrices

This page was built for publication: A finiteness theorem for W-graphs

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