Search arXivSearch

arXiv · 2403.11608

Truncated theta series from the Bailey lattice

Abstract

In 2012, Andrews and Merca obtained a truncated version of Euler's pentagonal number theorem and showed the nonnegativity related to partition functions. Meanwhile, Andrews-Merca and Guo-Zeng independently conjectured that the truncated Jacobi triple product series has nonnegative coefficients, which has been confirmed analytically and also combinatorially. In 2022, Merca proposed a stronger version for this conjecture. In this paper, by applying Agarwal, Andrews and Bressoud's Bailey lattice, we derive a truncated version for the Jacobi triple product series with odd basis which reduces to the Andrews-Gordon identity as a special instance. As consequences, we obtain new truncated forms for Euler's pentagonal number theorem, Gauss'theta series on triangular numbers and square numbers, which lead to inequalities for certain partition functions. Moreover, by considering a truncated theta series involving $\ell$-regular partitions, we confirm a conjecture proposed by Ballantine and Merca about 6-regular partitions and show that Merca's stronger conjecture on truncated Jacobi triple product series holds when $R = 3S$ for $S \geq 1.$

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiangyu Ding, Lisa Hui Sun. 2025-05-18. Truncated theta series from the Bailey lattice. https://arxiv.org/abs/2403.11608

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