A combinatorial model for $\nabla m_\mu$

TL;DR

This paper presents a new symmetric function identity linking hook monomial symmetric functions to the operators in the Compositional Shuffle Conjecture, providing combinatorial interpretations and conjecturing a model for general partitions.

Contribution

It introduces a symmetric function identity that relates hook monomials to shuffle conjecture operators, extending combinatorial interpretations and proposing a new expansion model.

Findings

Established a symmetric function identity for hook monomials

Provided a parking function interpretation for nabla of hook monomials

Connected the identity to a q-analog of known expansions

Abstract

The modified Macdonald polynomials introduced by Garsia and Haiman (1996) have many remarkable combinatorial properties. One such class of properties involves applying the $\nabla$ operator of Bergeron and Garsia (1999) to basic symmetric functions. The first discovery of this type was the Shuffle Conjecture of Haglund, Haiman, Loehr, Remmel, and Ulyanov (2005), which relates the expression $\nabla e_n$ to parking functions. A refinement of this conjecture, called the Compositional Shuffle Conjecture, was introduced by Haglund, Morse, and Zabrocki (2012) and proved by Carlsson and Mellit (2015). We give a symmetric function identity relating hook monomial symmetric functions to the operators used in the Compositional Shuffle Conjecture. This implies a parking function interpretation for nabla of a hook monomial symmetric function, as well as LLT positivity. We show that our identity is a $q$-analog of the expansion of a hook monomial into complete homogeneous symmetric functions given by Kulikauskas and Remmel (2006). We use this connection to conjecture a model for expanding $\nabla m_\mu$ in this way when $\mu$ is not a hook.