{"title":"Parabolic recursions for Kazhdan–Lusztig polynomials and the hypercube decomposition","authors":"Maxim Gurevich, Chuijia Wang","doi":"10.1007/s00029-024-00972-0","DOIUrl":null,"url":null,"abstract":"<p>We employ general parabolic recursion methods to demonstrate the recently devised hypercube formula for Kazhdan-Lusztig polynomials of <span>\\(S_n\\)</span>, and establish its generalization to the full setting of a finite Coxeter system through algebraic proof. We introduce procedures for positive decompositions of <i>q</i>-derived Kazhdan–Lusztig polynomials within this setting, that utilize classical Hecke algebra positivity phenomena of Dyer-Lehrer and Grojnowski–Haiman. This leads to a distinct algorithmic approach to the subject, based on induction from a parabolic subgroup. We propose suitable weak variants of the combinatorial invariance conjecture and verify their validity for permutation groups.</p>","PeriodicalId":501600,"journal":{"name":"Selecta Mathematica","volume":"29 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Selecta Mathematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s00029-024-00972-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We employ general parabolic recursion methods to demonstrate the recently devised hypercube formula for Kazhdan-Lusztig polynomials of \(S_n\), and establish its generalization to the full setting of a finite Coxeter system through algebraic proof. We introduce procedures for positive decompositions of q-derived Kazhdan–Lusztig polynomials within this setting, that utilize classical Hecke algebra positivity phenomena of Dyer-Lehrer and Grojnowski–Haiman. This leads to a distinct algorithmic approach to the subject, based on induction from a parabolic subgroup. We propose suitable weak variants of the combinatorial invariance conjecture and verify their validity for permutation groups.