Search arXivSearch

arXiv · 2606.27507

A combinatorial proof for the positivity of the normalized Jacobi triple product tails

Abstract

For $k\geq 1$, we prove that \[ [q^n z^s]J_k(z,q)\geq 0, \qquad (n\geq 0,\ s\in\mathbb Z) \] for the normalized Jacobi triple product tails \[ J_k(z,q) = \frac{ \sum_{j=k}^{\infty}(-1)^{j-k} q^{\binom{j+1}{2}}(z^{-j}+\cdots+z^j)} {(zq,q/z;q)_\infty}. \] This result not only implies Merca's stronger nonnegativity conjecture on truncated Jacobi triple product series in full generality, but also yields infinite families of linear inequalities for two-colored partitions and partitions with parts in the residue classes $\pm S \pmod{R}$. We present a combinatorial proof wherein a sign-reversing involution reduces the normalized Jacobi triple product tails to the invariant subsets according to the generalized minimal-excludant of partitions. Furthermore, by combing an invertible lift operator on Frobenius arms with Konan's size- and length-preserving bijection, an injection is constructed between the consecutive invariant subsets, which implies the coefficientwise positivity of the normalized Jacobi triple product tails.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiangyu Ding, Lisa Hui Sun. 2026-06-25. A combinatorial proof for the positivity of the normalized Jacobi triple product tails. https://arxiv.org/abs/2606.27507

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