A combinatorial formula for the nabla operator
Combinatorics
2025-09-24 v1 Representation Theory
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.
Keywords
Cite
@article{arxiv.2012.01627,
title = {A combinatorial formula for the nabla operator},
author = {Erik Carlsson and Anton Mellit},
journal= {arXiv preprint arXiv:2012.01627},
year = {2025}
}
Comments
35 Pages