Search arXivSearch

arXiv · 2509.24040

The nonsymmetric shuffle theorem

Abstract

The shuffle conjecture of Haglund et al. expresses the symmetric function $\nabla e_n$ as a sum over labeled Dyck paths. Here $\nabla$ is an operator on symmetric functions defined in terms of its diagonal action on the basis of modified Macdonald polynomials. The shuffle conjecture was later refined by Haglund-Morse-Zabrocki to the compositional shuffle conjecture, expressing $\nabla C_α$ as a sum over labeled Dyck paths with touchpoints specified by $α$, where $C_α$ is a compositional Hall-Littlewood polynomial. Carlsson-Mellit settled both versions by developing the theory of a variant of the DAHA called the double Dyck path algebra. In a recent paper, we discovered a notion of nonsymmetric plethsym which led us to a construction of modified nonsymmetric Macdonald polynomials $\mathsf{H}_{η|λ}(\mathbf{x};q,t)$. These polynomials Weyl symmetrize to their symmetric counterparts and are conjecturally atom positive. Here we introduce a nonsymmetric version $\boldsymbol{\nabla}$ of $\nabla$, now acting diagonally on the basis given by the functions $\mathsf{H}_{η|λ}(\mathbf{x};q,t)$. Weaving together our theory with results of Carlsson-Mellit and Mellit, we establish a nonsymmetric version of the compositional shuffle theorem, which equates $\boldsymbol{\nabla}^{-1}$ applied to a nonsymmetric version $\mathsf{C}_α$ of $C_α$ with a sum over flagged labeled Dyck paths with touchpoints given by $α$. This combinatorial sum is conjecturally atom positive, refining the known Schur positivity of its symmetric counterpart.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonah Blasiak, Mark Haiman, Jennifer Morse, Anna Pun, George H. Seelinger. 2025-09-28. The nonsymmetric shuffle theorem. https://arxiv.org/abs/2509.24040

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO