Combinatorial invariance for lower intervals using hypercube decompositions

From MaRDI portal





Kazhdan-Lusztig polynomials \(P_{u,v}(q)\) are polynomials associated to a pair \(u, v\) of elements of a Coxeter group \(W\). They were first introduced by \textit{D. Kazhdan} and \textit{G. Lusztig} [Invent. Math. 53, 165--184 (1979; Zbl 0499.20035)] as transition functions between the standard basis of the Hecke algebra of \(W\) and what is now called the Kazhdan-Lusztig basis.\N\NThe paper under review provides a new proof of combinatorial invariance for lower intervals in the symmetric group \(S_n\) (i.e., intervals of the form \([e,v]\) where \(e\) is the identity). Unlike previous proofs by \textit{F. Brenti} et al. [Adv. Math. 202, No. 2, 555--601 (2006; Zbl 1091.05075)] using special matchings, the authors employ hypercube decompositions, a recently introduced combinatorial structure that exists in all Bruhat intervals. Instead of working directly with Kazhdan-Lusztig polynomials, they study the related \(\widetilde{R}\)-polynomials and establish an explicit combinatorial recurrence using strong hypercube decompositions. The main theorem proves that \(\widetilde{R}_{e,v}(q)\) depends only on the poset structure of \([e,v]\).











This page was built for publication: Combinatorial invariance for lower intervals using hypercube decompositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926406)