Type \(A\) admissible cells are Kazhdan-Lusztig (Q2297560)

Representation theory of Hecke algebras motivates investigation of \(W\)-graphs and, in particular, these \(W\)-graphs which correspond to Kazhdan-Lusztig left cells. Regretfully, calculation of left cells requires calculation of a large number of Kazhdan-Lusztig polynomials. In order to avoid this difficulty, \textit{J. R. Stembridge} [Represent. Theory 12, 346--368 (2008; Zbl 1195.20043)] introduced admissible \(W\)-graphs which can be described combinatorially and can be constructed without calculating Kazhdan-Lusztig polynomials. The main result of the paper is that in type A all strongly connected admissible \(W\)-graphs are isomorphic to Kazhdan-Lusztig left cells (which provides a positive answer to a question asked by Stembridge). A byproduct of the proof of this result is an efficient algorithm for calculating \(W\)-graphs for left-cells in type A. The proof is a development of earlier results of \textit{M. Chmutov} [J. Algebr. Comb. 42, No. 4, 1059--1076 (2015; Zbl 1328.05195)]. The vertices of an arbitrary admissible \(W\)-graph turn out to correspond to standard tableaux. The set of standard tableaux carries a natural partial order related to the Bruhat order; the key technical result of the paper is that in type A each admissible \(W\)-graph is ordered (which, rougly speaking, says that the endpoints of each oriented arc are in the right order). Its proof employs combinatorics of tableaux.