Bisected theta series, least -gaps in partitions, and polygonal numbers
arXiv:1710.05960
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
10 pages