Bisected theta series, least $r$-gaps in partitions, and polygonal numbers
Cristina Ballantine, Mircea Merca

TL;DR
This paper introduces new partition functions based on least r-gaps, explores their connections with theta identities, polygonal numbers, and Euler's partition function, using combinatorial and q-series methods.
Contribution
It presents novel partition functions involving least r-gaps and establishes new identities linking these functions with classical theta identities, polygonal numbers, and Euler's partition function.
Findings
Derived new identities relating partition functions and polygonal numbers
Provided combinatorial interpretations for complex q-series sums
Connected theta series, partition functions, and polygonal numbers in novel ways
Abstract
The least -gap, , of a partition is the smallest part of appearing less than times. In this article we introduce two new partition functions involving least -gaps. We consider a bisection of a classical theta identity and prove new identities relating Euler's partition function , polygonal numbers, and the new partition functions. To prove the results we use an interplay of combinatorial and -series methods. We also give a combinatorial interpretation for
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
