Papers
Topics
Authors
Recent
Search
2000 character limit reached

A combinatorial formula for the nabla operator

Published 3 Dec 2020 in math.CO and math.RT | (2012.01627v1)

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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.