\(W\)-graph ideals. (Q1931691): Difference between revisions

Let \((W,S)\) be a Coxeter system and \(\mathcal H\) the associated Hecke algebra. \textit{D. Kazhdan} and \textit{G. Lusztig} [Invent. Math. 53, 165-184 (1979; Zbl 0499.20035)] introduced the concept of a \(W\)-graph for constructing representations of \(W\) and \(\mathcal H\). Let \(\leqslant_L\) be the left weak order on \(W\). The present paper is to introduce the concept of a \(W\)-graph ideal \(\mathcal I\) in the poset \((W,\leqslant_L)\) and to give a Kazhdan-Lusztig like algorithm for producing a \(W\)-graph with vertices indexed by the elements of \(\mathcal I\). The main focus of the paper is in type \(A\), an algorithm is described in constructing \(W\)-graphs for Specht modules.