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

0

Discussion (0)

Sign in to join the discussion.

Loading comments…