In algebraic combinatorics, we often encounter a frustrating asymmetry: we can define highly complex combinatorial statistics on objects like lattice paths, trees, or graphs, but proving their fundamental properties—such as symmetry or positivity—is remarkably difficult using purely combinatorial tools.
The breakthrough strategy of this field is to build an algebraic bridge. By interpreting these combinatorial statistics as the coefficients of symmetric functions acted upon by specialized operators ($\nabla$, $\Delta$, and $\Theta$), researchers can leverage the deep, rigid structural properties of symmetric function theory. Properties that are invisible or incredibly tedious to prove bijectively emerge naturally from the underlying algebra.
The Bridge Between Algebra and Combinatorics
To understand why this approach works, consider a classic combinatorial problem: counting paths on a grid according to joint statistics like area (the space below the path) and dinv (a measure of diagonal inversions). Tracking these statistics simultaneously yields complex polynomials in two variables, $q$ and $t$.
Proving that a polynomial is symmetric in $q$ and $t$ purely combinatorially requires finding a bijection that swaps the statistics while preserving the structure—a notoriously difficult task. However, within the space of symmetric functions, we have access to Macdonald polynomials. These polynomials form a basis that inherently incorporates $q$ and $t$ parameters, and they diagonalize certain linear operators.
When we apply an operator like $\nabla$ (nabla) to an elementary symmetric function, the result is an expression whose inner products reveal these $q,t$-polynomials. Because the operator itself possesses structural symmetries inherited from the geometry of diagonal harmonics, the $q,t$-symmetry of the combinatorial counts follows as an immediate algebraic consequence.
The Delta Conjecture and Labeled Lattice Paths
A central focus of this research direction is the Delta Conjecture, which generalizes the celebrated Shuffle Theorem. The conjecture posits a direct identity between a specific symmetric function operator, $\Delta'_{e_{n-k}} e_n$, and the $q,t$-enumeration of decorated, partially labeled Dyck paths (lattice paths that stay above the diagonal).
The conjecture splits into two primary formulations based on the underlying combinatorial features:
- The Rise Version: Focuses on the "rises" (consecutive vertical steps) of the Dyck paths.
- The Valley Version: Focuses on the "valleys" (local minima formed by a horizontal step followed by a vertical step).
While the rise version yielded to algebraic techniques more readily, the valley version has proven exceptionally stubborn. As Michele D'Adderio et al. explain in Some Consequences of the Valley Delta Conjectures, a major hurdle is that the combinatorial sums generated by valleys are not a priori known to be symmetric functions. Proving this implicit symmetry is itself a massive challenge, though the authors successfully established key cases, including the Schröder and Catalan variants.
To make these sweeping conjectures tractable, researchers often isolate specific boundary cases to build intuition and recursive frameworks. For instance, in The Schröder case of the generalized Delta conjecture, Michele D'Adderio et al. utilized plethystic formulae to prove the conjecture for paths allowed to have diagonal steps. Similarly, in The generalized Delta conjecture at t=0, Michele D'Adderio et al. collapsed one of the parameters to $0$, simplifying the $q,t$-enumerator into a $q$-enumerator of ordered multiset partitions, which allowed them to bypass the full complexity of the joint distribution.
Theta Operators as a Unifying Framework
For years, progress on these conjectures relied on fragmented, highly specific algebraic identities. The introduction of Theta operators ($\Theta_F$) fundamentally changed the landscape by providing a unified, recursive mechanism to manipulate these symmetric functions.
In a landmark result, Anton Mellit utilized these operators in A proof of the compositional Delta conjecture to formally prove the rise version of the Delta conjecture and its compositional refinement. Theta operators act on the ring of symmetric functions by extending plethystic calculus, allowing researchers to inductively build up paths step-by-step while tracking how the algebraic operators evolve alongside the combinatorial statistics.
The true power of Theta operators lies in their ability to synthesize disparate identities. Rather than treating every new combinatorial variation as an isolated phenomenon, researchers can view them as different evaluations of a single operator framework. Marino Romero demonstrated this in New identities for theta operators, showing that a central identity—derived from the classical five-term relation and Tesler's identity—can efficiently recover numerous existing formulas in the study of Macdonald polynomials and diagonal coinvariants.
This framework easily generalizes beyond lattice paths. For example, Michele D'Adderio et al. extended this machinery to graph theory in Tiered Trees and Theta Operators, using Theta operators to provide an explicit formula for enumerating tiered trees and connecting abstract quiver representations directly to combinatorial tableaux.
Unlocking Symmetries and Positivity
Why go through the trouble of translating paths and trees into abstract symmetric function operators? Because once a combinatorial statistic is successfully identified with an operator expression, deep structural properties of the polynomial immediately become clear.
Proving $q,t$-Symmetry
Consider the $q,t$-analogue of Narayana numbers, which count configurations of parallelogram polyominoes. In Statistics on parallelogram polyominoes and a q,t-analogue of the Narayana numbers, Jean-Christophe Aval et al. proved that these polynomials could be interpreted algebraically as an inner product involving the nabla operator:
$$\langle \nabla e_{m+n-2}, h_{m-1}h_{n-1} \rangle$$
Because $\nabla$ is known to act diagonally on the Macdonald polynomial basis with eigenvalues that are symmetric in $q$ and $t$, the symmetry of the polyomino statistics is guaranteed by the algebra, bypassing the need for an explicit, highly elusive bijective proof.
Establishing $e$-Positivity
Another profound application is proving $e$-positivity—showing that a chromatic symmetric function (a generalization of the graph coloring polynomial) can be written as a non-negative linear combination of elementary symmetric functions ($e_\lambda$). If a graph's symmetric function is $e$-positive, it implies the existence of an underlying algebraic structure, such as a representation of the symmetric group.
Researchers use this operator framework to map out which graph families possess this property:
- Forbidden Subgraphs: In Chromatic symmetric functions and H-free graphs, Jake Tuero et al. proved $e$-positivity for graphs that avoid specific forbidden structures, such as (claw, paw)-free and (claw, paw, co-paw)-free graphs.
- Interval Orders: In Chromatic functions, interval orders and increasing forests, Roberto Riccardi et al. expanded the scope from unit interval orders to broader interval orders. By linking chromatic quasisymmetric functions to increasing spanning forests, they provided a new geometric perspective on the Stanley-Stembridge conjecture, illustrating how operator-driven symmetric function theory continues to resolve open questions across combinatorics.