Stable-limit partially symmetric Macdonald functions and parabolic flag Hilbert schemes
Daniel Orr, Milo Bechtloff Weising

TL;DR
This paper extends the understanding of Macdonald functions by explicitly computing their images in the context of parabolic flag Hilbert schemes, confirming a conjecture and linking algebraic and geometric structures.
Contribution
It explicitly computes the images of fixed point classes under a key isomorphism, confirming a conjecture about partially symmetric Macdonald polynomials and connecting algebraic and geometric frameworks.
Findings
Computed images of fixed point classes match modified partially symmetric Macdonald polynomials.
Confirmed prior conjecture by Goodberry-Orr on these polynomials.
Provided an explicit formula for the involution action on the polynomial representation.
Abstract
The modified Macdonald functions are fundamental objects in modern algebraic combinatorics. Haiman showed that there is a correspondence between the -fixed points of the Hilbert schemes and the functions realizing a derived equivalence between -equivariant coherent sheaves on and -equivariant coherent sheaves on Carlsson--Gorsky--Mellit introduced a larger family of smooth projective varieties called the parabolic flag Hilbert schemes. They showed that an algebra , directly related to the double Dyck path algebra employed in Carlsson--Mellit's proof of the Shuffle Theorem, acts naturally on the…
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
TopicsNonlinear Waves and Solitons · Algebraic structures and combinatorial models · Algebraic Geometry and Number Theory
