
TL;DR
This paper refines the decomposition theorem for Schubert varieties, providing a recursive method to extract Kazhdan-Lusztig polynomials and introducing a new basis in the Hecke algebra derived from equivariant resolutions.
Contribution
It offers an effective version of the decomposition theorem and a recursive procedure to compute Kazhdan-Lusztig polynomials without prior minimal set knowledge.
Findings
Recursive procedure for Kazhdan-Lusztig polynomial extraction
New basis in the Hecke algebra from equivariant resolutions
Method to compute transition matrix between bases
Abstract
Let be a Schubert variety in a flag manifold and let be a Bott-Samelson resolution of . In this paper we prove an effective version of the decomposition theorem for the derived pushforward . As a by-product, we obtain recursive procedure to extract Kazhdan-Lusztig polynomials from the polynomials introduced by V. Deodhar in \cite{Deo}, which does not require prior knowledge of a minimal set. We also observe that any family of equivariant resolutions of Schubert varieties allows to define a new basis in the Hecke algebra and we show a way to compute the transition matrix, from the Kazhdan-Lusztig basis to the new one.
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 · Advanced Mathematical Identities · Advanced Algebra and Geometry
