A combinatorial formula for the nabla operator
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 $\nablak e_n$, and the Elias-Hogancamp formula for $(\nablak p_1n,e_n)$ as corollaries. We give a direct proof of the theorem by verifying that the LLT expansion satisfies the defining properties of $\nablak$, such as triangularity in the dominance order, as well as a geometric proof based on a method for counting bundles on $\mathbb{P}1$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.