On Kazhdan-Lusztig cells in type \(B\). (Q2269530)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On Kazhdan-Lusztig cells in type \(B\).
scientific article

    Statements

    On Kazhdan-Lusztig cells in type \(B\). (English)
    0 references
    0 references
    17 March 2010
    0 references
    Let \(W_n\) be the Weyl group of type \(B_n\). \textit{G. Lusztig} partitioned \(W_n\) into Kazhdan-Lusztig cells with certain unequal parameters [in Lect. Notes Math. 1024, 99-111 (1983; Zbl 0537.20019)]. By combinatorial \((a,b)\)-cells of \(W_n\), one means certain equivalence classes of \(W_n\) which depend on two parameters \(a,b\) and are defined combinatorially using domino insertion algorithm. Recently, \textit{M. Taskin} [in ``Plactic relations for \(r\)-domino tableaux'', \url{arXiv:0803.1148}] and \textit{T. Pietraho} [in J. Algebr. Comb. 29, No. 4, 509-535 (2009; Zbl 1226.05261)] independently provided plactic/coplactic relations for the domino insertion algorithm. The paper under review is concerned with the partition of \(W_n\) into Kazhdan-Lusztig cells for any choice of unequal parameters \(a,b\). The main result of the paper is to prove that for any choice of parameters \(a,b\), the Kazhdan-Lusztig cells of \(W_n\) are unions of combinatorial \((a,b)\)-cells. The methods rely heavily on the results of Taskin and Pietraho.
    0 references
    Weyl groups of type \(B\)
    0 references
    Kazhdan-Lusztig theory
    0 references
    unequal parameters
    0 references
    cells
    0 references
    domino insertion algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references