Search arXivSearch

arXiv · 2609.17744

The Theta Conjecture

Abstract

We define a diagonal-inversion statistic on labeled Dyck paths carrying both decorated rises and decorated contractible valleys. This gives an explicit candidate for a bivariate refinement of the univariate Theta conjecture of D'Adderio, Iraci, and Vanden Wyngaerd, recently proved by D'Adderio, Pagaria, and the authors of this work. The univariate conjecture can be recovered from our bivariate version by setting $q=1$. The new conjecture recovers the rise and valley versions of the Delta conjecture when either decoration parameter vanishes, and provides a combinatorial interpretation of the symmetric function $Θ_{e_l} Θ_{e_k}\nabla e_{n-k-l}$, which is also conjectured to be the Frobenius characteristic of a certain graded module of diagonal coinvariants with two sets of commuting variables and two sets of anticommuting variables. In support of the Theta conjecture and its touching refinement, we prove its Schröder case, that is, the scalar product of the symmetric function side with $e_{n-d} h_d$ matches the combinatorial side restricted to Schröder paths. The proof uses a finer combinatorial argument than the previously known cases, leveraging two Gaussian product identities.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Giovanni Interdonato, Alessandro Iraci. 2026-09-15. The Theta Conjecture. https://arxiv.org/abs/2609.17744

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