A combinatorial formula for the nabla operator
arXiv:2012.01627 · doi:10.1112/S0010437X24007760
Abstract
We present an LLT-type formula for a general power of the nabla operator applied to the Cauchy product for the modified Macdonald polynomials, and use it to deduce a new proof of the generalized shuffle theorem describing , and the Elias-Hogancamp formula for as corollaries. We give a direct proof of the theorem by verifying that the LLT expansion satisfies the defining properties of , such as triangularity in the dominance order, as well as a geometric proof based on a method for counting bundles on due to the second author. These formulas are related to an affine paving of the type A unramified affine Springer fiber studied by Goresky, Kottwitz, and MacPherson, and also to Stanley's chromatic symmetric functions.
arXiv comment35 Pages
References in corpus (7)
- Vanishing theorems and character formulas for the Hilbert scheme of points in the plane
- Toric braids and -parking functions
- -Schur functions and affine Schubert calculus
- Hilbert schemes and -ification of Khovanov-Rozansky homology
- On the computation of torus link homology
- Sweeping up Zeta
- Geometric representations of graded and rational Cherednik algebras