2000 character limit reached
A Reduction theorem for the $W$-graph decomposition conjecture
Published 10 Jul 2017 in math.RT | (1707.02952v1)
Abstract: Let $W$ be a finite Coxeter group and $\Omega$ be its $W$-graph algebra as defined by Gyoja. The author's previous paper \cite{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=W_1\times W_2$ if it holds for $W_1$ and $W_2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.