An effective decomposition theorem for Schubert varieties
Francesca Cioffi, Davide Franco, Carmine Sessa

TL;DR
This paper introduces a new decomposition theorem for Schubert varieties, providing detailed insights into their derived pushforwards, Poincaré polynomial expressions, and an algorithm to compute these terms, revealing fewer summands than supports.
Contribution
It presents a novel decomposition theorem for Schubert varieties, enhancing understanding of their derived pushforwards and offering an algorithm for computing Poincaré polynomial terms.
Findings
Derived pushforward decompositions for Schubert varieties clarified
Algorithm for computing Poincaré polynomial terms developed
Number of direct summands is less than the number of supports
Abstract
Given a Schubert variety contained in a Grassmannian , we show how to obtain further information on the direct summands of the derived pushforward given by the application of the decomposition theorem to a suitable resolution of singularities . As a by-product, Poincar\'e polynomial expressions are obtained along with an algorithm which computes the unknown terms in such expressions and which shows that the actual number of direct summands happens to be less than the number of supports of the decomposition.
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 · Polynomial and algebraic computation · Advanced Mathematical Identities
