The nonsymmetric compositional Delta theorem

Abstract: Extending the symmetric framework of D'Adderio and Mellit, we establish a nonsymmetric generalization of the compositional Delta theorem. Building on Blasiak et al.'s theory of flagged LLT polynomials, we derive signed and unsigned nonsymmetric identities evaluated in terms of flagged LLT polynomials. Furthermore, by introducing nonsymmetric variants of the $\nabla$ and $τ^*$ operators, we obtain a novel operator formulation. We show that applying Weyl symmetrization to these nonsymmetric identities systematically recovers the original compositional Delta theorem. Finally, we propose analogous conjectures regarding stable atom positivity.

• The paper establishes a nonsymmetric analogue of the compositional Delta theorem using operator-based techniques with flagged LLT polynomials.
• It develops new operator identities for nonsymmetric Macdonald polynomials, connecting them to combinatorial constructs like parking functions and Dyck paths.
• The work reveals implications for combinatorial positivity and representation theory, systematically generalizing classical symmetric results.

The Nonsymmetric Compositional Delta Theorem: An Expert Synthesis

Introduction and Context

The compositional Delta theorem is a cornerstone in the modern study of symmetric functions and algebraic combinatorics, encapsulating deep connections between Macdonald polynomials, diagonal harmonics, parker functions, and Dyck path combinatorics. The classical Delta conjecture, resolved by D'Adderio and Mellit, and its compositional refinement, frame powerful combinatorial-symmetric function correspondences at the heart of subject.

The work "The nonsymmetric compositional Delta theorem" (2604.10226) presents a substantial generalization of these results into the nonsymmetric field, extending the symmetric theory to settings involving nonsymmetric Macdonald polynomials. Building on recent advances in the theory of flagged LLT polynomials and new operator-theoretic constructs, this paper constructs and proves a natural nonsymmetric analogue of the compositional Delta theorem. The resulting theorem not only recovers known results in the symmetric case via Weyl symmetrization but also introduces new operator identities and conjectures regarding positivity in this more general framework.

Mathematical Framework: Symmetric and Nonsymmetric Macdonald Worlds

The classical theory operates in the algebra of symmetric functions $[X]$, with the modified Macdonald polynomials $\tilde{H}_\mu(X;q,t)$ forming the central basis. Operators such as nabla ($\nabla$), Delta ($\Delta_f$), and Theta ($\Theta_f$) act naturally on this space and encapsulate combinatorial statistics such as area and diagonal inversion ($\dinv$) arising from Dyck path and parking function enumeration.

The nonsymmetric theory replaces the symmetric Macdonald basis with the nonsymmetric Macdonald polynomials $E_\alpha(x_1, \ldots, x_n; q, t)$. The combinatorial side of this theory is naturally described using flagged LLT polynomials (arising from partial Dyck paths with specific marking rules and flagged semistandard fillings), and their algebraic structure is framed within modules allowing partial symmetry (nonsymmetric in the first $\ell$ variables and symmetric in the rest).

A crucial technical innovation is the $\ell$-nonsymmetric plethysm operation, extending the operator $f[X] \mapsto f[X/(1-t)]$ to partially symmetric settings. Together with the Weyl symmetrization (Demazure operator-induced limiting process), these constructs permit systematic translation between nonsymmetric and symmetric worlds and underpin the main theorems.

The Main Theorems: Nonsymmetric Compositional Delta Theorem

Algebraic and Combinatorial Objects

Let $\tilde{H}_\mu(X;q,t)$0 be a composition, and consider the set of flagged parking functions, flagged word parking functions, and associated flagged LLT polynomials. The combinations of area ($\tilde{H}_\mu(X;q,t)$1) and various inversion statistics ($\tilde{H}_\mu(X;q,t)$2) parameterize the polynomial coefficients on the combinatorial side.

On the algebraic side, the main actors are

• modified $\tilde{H}_\mu(X;q,t)$3-nonsymmetric Macdonald polynomials,
• new, nonsymmetric analogues of nabla ($\tilde{H}_\mu(X;q,t)$4) and Theta ($\tilde{H}_\mu(X;q,t)$5) operators,
• and the $\tilde{H}_\mu(X;q,t)$6 family of operators (with their starred and conjugated versions).

The compositional operators act on monomials $\tilde{H}_\mu(X;q,t)$7 via elaborate operator factorizations.

The Signed and Unsigned Theorems

Signed Version: The first main result is a signed nonsymmetric compositional Delta theorem. The left-hand side comprises an explicit operator formula—using the conjugated Dyck path algebra and nabla/Theta operators—acting on monomials indexed by composition $\tilde{H}_\mu(X;q,t)$8, with the outcome expressed as a signed sum over flagged row LLT polynomials parameterized by decorated Dyck paths with fixed diagonal composition:

$\tilde{H}_\mu(X;q,t)$9

Unsigned Version: The unsigned (plethysm-processed) version replaces the signed operators via the $\nabla$0-nonsymmetric plethysm map, giving

$\nabla$1

Further expansion expresses the right side as a sum over flagged weak word parking functions with area and $\nabla$2 parameters, independent of signed fillings.

Alternative Operator Formulations: By translating operator identities through additional involutive automorphisms and new generalizations of the $\nabla$3 operator (via the $\nabla$4-involution and its conjugates), alternative versions parallel to the symmetric statements are achieved, with the operator side matching the combinatorial side in terms of flagged column LLT polynomials.

Symmetrization and Recovery of the Symmetric Delta Theorem

Applying the Weyl symmetrization operator ($\nabla$5) to these nonsymmetric identities, the machinery recovers precisely the (omega) symmetric compositional Delta theorem and its combinatorial formula in the symmetric Macdonald setting:

$\nabla$6

The detailed algebraic manipulations in the proofs establish this as a systematic, not accidental, recovery: the nonsymmetric theory indeed strictly generalizes the symmetric one in an operator-theoretic and combinatorial sense.

Numerical and Structural Strengths

• Positivity: The identities established express the operator side as a sum over explicitly positive combinatorial quantities (number of flagged parking functions/LLT fillings with area and weighted inversion statistics). This immediately yields Schur positivity upon symmetrization; moreover, the paper conjectures stronger stable atom positivity (in the sense of Demazure atoms) for the nonsymmetric combinatorial classes.
• Strict Generalization: Setting $\nabla$7 recovers the nonsymmetric shuffle theorem (see [nsshuffle]); setting $\nabla$8 and applying complete symmetrization recovers classical (symmetric) results, demonstrating the strength and appropriateness of the formalism.
• Operator Factorizations: The new operator factorizations and identities, including conjugations of $\nabla$9, new versions of nabla and Theta, and explicit isomorphisms/intertwining relations, are robust tools likely to have utility far beyond this specific result.

Implications and Directions

This paper completes a broad, parallel noncommutative/nonsymmetric extension of the shuffle and Delta theorems, suggesting that many deep combinatorial and representation-theoretic objects (e.g., parking functions, diagonal coinvariant rings, Hilbert schemes) can be profitably recast and generalized using nonsymmetric Macdonald and LLT theory, especially in settings involving Demazure modules or other partially symmetric situations.

Conjectured stable atom positivity would have significant implications for understanding the internal combinatorial and representation-theoretic structure of these polynomials, possibly informing positivity and basis phenomena current in the $\Delta_f$0-Schur and quasisymmetric function literatures.

Further, the systematic algebraic translation between symmetric and nonsymmetric settings via plethysm and symmetrization, as well as the equivalence of combinatorial enumerative generating functions at each step, may inspire new isomorphism theorems and links between module categories.

Future Outlook

• Proof of Atom Positivity: A proof of stable atom positivity for flagged LLT polynomials or their associated combinatorial polynomials would not only solidify the combinatorial basis theory for nonsymmetric Macdonald theory but might also impact the study of Demazure representations and categorification programs.
• Extension to Other Algebraic Structures: The operator identities suggest the possibility of analogous nonsymmetric extensions in the context of double affine Hecke algebras, (quantum) Schur-Weyl duality, and the theory of diagonal harmonics over other reflection groups.
• Structural Theorems for Nonsymmetric Theta: The conjectural analogues of the operator-level Delta combinatorics (equating certain composed operators to sums over basic actions) in the nonsymmetric setting, if proved, would provide a clean and transparent "machine" for generating generalized compositional theorems.

Conclusion

"The nonsymmetric compositional Delta theorem" (2604.10226) provides a comprehensive, operator-theoretic, and combinatorially explicit nonsymmetric generalization of the compositional Delta theorem. The work synthesizes flagging, plethysm, operator algebra, and fine combinatorics into a coherent, strictly parallel framework connecting the symmetric and nonsymmetric worlds. Its theorems, constructions, and conjectures open substantial new avenues for research in algebraic combinatorics and related algebraic disciplines.