W-graph ideals. II. (Q1931694)

Let \((W,S)\) be a Coxeter system. The present paper is a continuation of the work in part I by \textit{R. B. Howlett} and \textit{Van Minh Nguyen} [J. Algebra 361, 188-212 (2012; Zbl 1271.20002)] concerning a Kazhdan-Lusztig like algorithm to produce a \(W\)-graph from a \(W\)-graph ideal in the poset \((W,\leqslant_L)\), where \(\leqslant_L\) is the left weak order on \(W\). The paper is to describe a large class of \(W\)-graph ideals for an arbitrary Coxeter group and to explain the way of constructing \(W\)-graphs for a wide class of Kazhdan-Lusztig left cells without having to first construct the full Kazhdan-Lusztig \(W\)-graph corresponding to the regular representation. The result of the paper justifies the algorithm described in [loc. cit.] for the construction of \(W\)-graphs for Specht modules in type \(A\) case.