English

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 ken\nabla^k e_n, and the Elias-Hogancamp formula for (kp1n,en)(\nabla^k p_1^n,e_n) as corollaries. We give a direct proof of the theorem by verifying that the LLT expansion satisfies the defining properties of k\nabla^k, such as triangularity in the dominance order, as well as a geometric proof based on a method for counting bundles on P1\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.

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

R2 v1 2026-06-23T20:41:28.300Z