A Reduction theorem for the W-graph decomposition conjecture
Abstract
Let W be a finite Coxeter group and be its W-graph algebra as defined by Gyoja. The author's previous paper hahn2016wgraphs considered this algebra in some detail, proposed, and proved in some small cases the W-graph decomposition conjecture. The purpose of the current paper is to prove a reduction theorem for (a slightly stronger version of) that conjecture to indecomposable Coxeter groups in the sense that the conjecture is true for W=W1× W2 if it holds for W1 and W2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.