Combinatorial formulas for Kazhdan-Lusztig polynomials with respect to W-graph ideals
Qi Wang

TL;DR
This paper develops combinatorial formulas for weighted Kazhdan-Lusztig polynomials within W-graph ideals of Coxeter systems, extending previous results and providing new computational tools.
Contribution
It introduces explicit combinatorial formulas for weighted Kazhdan-Lusztig polynomials in W-graph ideals, expanding on prior theoretical frameworks.
Findings
Derived combinatorial formulas for $P_{x,y}$
Extended Brenti's and Deodhar's results
Enhanced understanding of weighted Coxeter systems
Abstract
Let be a weighted Coxeter system and a subset of , Yin [12] introduced the weighted -graph ideal and the weighted Kazhdan-Lusztig polynomials . In this paper, we study the combinatorial formulas for , which will extend the results of Brenti [2] and Deodhar [5].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Commutative Algebra and Its Applications · Topological and Geometric Data Analysis
