1. Introduction
Recall that a partition of a positive integer $n$
is an integer sequence $\lambda =(\lambda _1,\, \lambda _2,\, \ldots,\, \lambda _k)$
such that $\lambda _1\geq \lambda _2\geq \cdots \geq \lambda _k>0$
and $\lambda _1 +\lambda _2+\cdots +\lambda _k=n$
. The numbers $\lambda _i$
are called parts of $\lambda$
[Reference Andrews2]. As usual, let $p(n)$
denote the number of partitions of $n$
and set $p(0)=1$
and $p(x)=0$
when $x$
is a negative integer. Euler found that the generating function for $p(n)$
is

Here and throughout the paper, we assume that $|q|<1$
and the $q$
-shifted factorials are defined by

In addition, the $q$
-binomial coefficient is defined by

The reciprocal of the right-hand side of (1.1) has an interesting series representation as follows:

which is Euler's pentagonal number theorem.
In 2012, Andrews and Merca [Reference Andrews and Merca3] proved the following theorem which is a truncated version of Euler's pentagonal number theorem.
Theorem 1.1 Andrews and Merca [Reference Andrews and Merca3]
Let $k$
be a positive integer. Then,

In addition, Andrews and Merca [Reference Andrews and Merca3] presented a partition-theoretic interpretation of the truncated sum in (1.3), namely,

where $M_k(n)$
is the number of partitions of $n$
in which $k$
is the least integer that is not a part and there are more parts $>k$
than there are $< k$
.
Apart from Euler's pentagonal number theorem, there are two other classical theta identities due to Gauss:

and

Motivated by Andrews and Merca's work, Guo and Zeng [Reference Guo and Zeng11] established the truncated versions of (1.5) and (1.6) in 2013. More precisely, they proved that for $k\geq 1$
,

and

Recently, using the Rogers–Fine identity, Andrews and Merca [Reference Andrews and Merca4] proved the following two nice identities:


where $k$
is a positive integer. In addition, Wang and Yee [Reference Wang and Yee27] derived the following truncated identity of (1.5):

where $k$
is a positive integer. Very recently, Xia et al. [Reference Xia, Yee and Zhao29] established new truncated theorems of the three classical theta series identities in (1.2), (1.5), and (1.6) by taking different truncated series than the ones chosen by Andrews–Merca and Guo–Zeng. More precisely, they proved that for $k\ge 1$
,



Other recent investigations on the truncated theta series can be found in the papers of Ballantine et al. [Reference Ballantine, Merca, Passary and Yee5], Burnette and Kolitsch [Reference Burnette and Kolitsch6], Chan et al. [Reference Chan, Ho and Mao7], Chern [Reference Chern8], Kolitsch [Reference Kolitsch13], Mao [Reference Mao16, Reference Mao17], Merca [Reference Merca18–Reference Merca20, Reference Merca, Wang and Yee22], Merca and Yee [Reference Merca and Yee21], Seo and Yee [Reference Seo and Yee23, Reference Seo and Yee24], Wang and Yee [Reference Wang and Yee25, Reference Wang and Yee27], Xia [Reference Xia28], Xia and Zhao [Reference Xia and Zhao30], Yao [Reference Yao31], and Zhang [Reference Zhang33].
The aim of this paper is to deduce new truncated sums for the three classical theta series identities in (1.2), (1.5), and (1.6) by using a Bailey pair given by Lovejoy [Reference Lovejoy15], which imply the results proved by Andrews–Merca [Reference Andrews and Merca3], Wang–Yee [Reference Wang and Yee27], and Xia–Yee–Zhao [Reference Xia, Yee and Zhao29].
The main results of this paper can be stated as follows.
Theorem 1.2 Let $r$
and $k$
be positive integers. Then,

Theorem 1.3 Let $r$
and $k$
be positive integers. Then,


Theorem 1.4 Let $r$
and $k$
be positive integers. Then,


Remark Setting $r=1$
in (1.15) and (1.17)–(1.19), we arrive at (1.3), (1.13), (1.10), and (1.14), respectively. Putting $r=1$
in (1.16) and utilizing the $q$
-binomial theorem stated in § 2, we can deduce (1.11). Taking $r=2$
in (1.15) yields (1.12).
Note that identities (1.5) and (1.6) are related to the overpartition function $\bar {p}(n)$
and the partitions with odd parts distinct function ${\rm pod}(n)$
(the pod function for short), which are two important partition functions. Recall that an overpartition of $n$
is a partition of $n$
where the first occurrence of each distinct part may be overlined. For instance, there are 14 overpartitions of 4:
For convenience, define $\bar {p}(0)$
to be $1$
. The generating function for $\bar {p}(n)$
is

For more details on overpartition, see [Reference Corteel and Lovejoy9]. A partition with odd parts distinct is a partition in which odd parts are distinct but even parts are unrestricted. Let ${\rm pod}(n)$
denote the number of such partitions of $n$
with ${\rm pod}(0) = 1$
. The generating function of ${\rm pod}(n)$
is

For more details on partitions with odd parts distinct, see [Reference Hirschhorn and Sellers12]. Since the generating functions for $\bar {p}(n)$
and ${\rm pod}(n)$
are the reciprocals of the products in (1.5) and (1.6), Guo and Zeng [Reference Guo and Zeng11] established infinite families of linear inequalities for $\bar {p}(n)$
and $pod(n)$
based on (1.7) and (1.8). More precisely, they proved that, for $n\geq 1$
and $k\geq 1$
,

and

Motivated by the fact that (1.2) has a partition-theoretic interpretation, namely $M_k(n)$
, Guo and Zeng [Reference Guo and Zeng11] posed an open problem to give partition-theoretic interpretations for the two truncated sums in (1.7) and (1.8). Recently, based on (1.9) and (1.10), Andrews and Merca [Reference Andrews and Merca4] provided an affirmative answer to the question by introducing new partition functions $\overline {M}_k(n)$
and $MP_k(n)$
. For more details, see the paper of Andrews and Merca [Reference Andrews and Merca4]. Note that identity (1.11) yields

which was first conjectured by Guo and Zeng [Reference Guo and Zeng11], proved independently by Mao [Reference Mao16] and Yee [Reference Yee32]. Based on (1.12)–(1.14), Xia et al. [Reference Xia, Yee and Zhao29] derived infinite families of linear inequalities involving $p(n)$
, $\bar {p}(n)$
, and ${\rm pod}(n)$
which imply the positivity of the truncated sums in (1.4) and (1.24).
In this paper, we will also define several partition functions to provide partition-theoretic interpretations for the coefficients of the right-hand sides of (1.15)–(1.19). We defer their definitions to § 3–5 since the descriptions of those partitions are complex.
The rest of this paper is organized as follows. In § 2, we recall some basic facts on basic hypergeometric series and Bailey pairs and pose a lemma. In § 3–5, we prove Theorems 1.2–1.4 based on some formulas given in § 2 and present their corollaries.
2. Preliminaries
In order to prove the main results of this paper, we recall some formulas on basic hypergeometric series and some facts on Bailey pairs, and then present a lemma.
First of all, the $q$
-binomial theorem [Reference Gasper and Rahman10, p. 354, (II.3)] can be stated as follows:

Setting $a=q^{-n}$
in (2.1) yields

Moreover, we require the following identity [Reference Gasper and Rahman10, p. 351, (I. 8)]
and the fact that if $m\geq 1$
and $0< j\leq m$
Next, we recall some basic facts on Bailey pairs which will be used to prove an important lemma. Let $\{\alpha _n\}_{n\geq 0}$
and $\{\beta _n\}_{n\geq 0}$
be two sequences. Then the pair of sequence $(\alpha _n,\, \beta _n)$
is called a Bailey pair relative to $(a,\, q)$
if $\alpha _n$
and $\beta _n$
are related by the following identity [Reference Andrews1, Chapter 3]: for $n\geq 0$

Finally, we prove a lemma, which will play a central role in our proofs.
Lemma 2.1 Let $m$
be a non-negative integer. Then

Proof. In 2012, Lovejoy [Reference Lovejoy15, (2.25) and (2.26)] found that $(\alpha _n,\, \beta _n)_{n\geq 0}$
is a Bailey pair relative to $(a,\,q)$
, where
and
Recently, based on an identity due to Liu [Reference Liu14], Wang and Yee [Reference Wang and Yee26] proved that if $(\alpha _n,\,\beta _n)$
is a Bailey pair relative to $(a,\, q)$
and $m$
is a non-negative integer, then

Combining (2.7)–(2.9), we arrive at (2.6). This completes the proof.
Setting $b \rightarrow \infty$
in (2.6), we get the following corollary:
Corollary 2.2 If $m$
is a non-negative integer, then

3. Ordinary partitions
The aim of this section is to prove Theorem 1.2 and present its corollary.
3.1. Proof of Theorem 1.2
Taking $c \rightarrow \infty$
in (2.10) yields

where $m$
is a non-negative integer. Let $r$
be a positive integer. If we set $a=q^{r}$
in (3.1) and then multiply both sides by $(q;q)_r$
, we arrive at

In view of (3.2),




which yields (1.15) after replacing $m$
by $k-1$
. This completes the proof of Theorem 1.2.
3.2. A corollary of Theorem 1.2
From Theorem 1.2, we deduce the following corollary.
Corollary 3.1 Let $r$
be a positive integer and define
For $n\geq 1$
and $k\geq 1$
,

where $A(k,\,r,\,n)$
is the number of partitions of $n$
in which $k$
is the least integer such that
(1) every part $< k$
appears at least once;(2) for any integer $t$
with $0\leq t\leq r-1$
,$k+t$
is not a part;(3) there are more parts $>k+r-1$
than there are $< k$
.
For example, setting $r=3$
in Corollary 3.1 and simplifying yields

Taking $k=2$
in (3.5), we deduce that for $n\geq 1$
,
If $n=17$
, then

since the six partitions in questions are
Proof of Corollary 3.1 First, we note that $\frac {q^{n(k+r)}}{(q;q)_n}$
is the generating function for partitions into $n$
parts $\geq k+r$
. Furthermore,
is the generating function for partitions into $k-1$
distinct parts $\leq n-1$
, and by conjugation, this is the generating function for partitions into at most $n-1$
parts with every integer $< k$
appearing as a part. Thus,

It follows from (1.1), (1.15), (3.3), and (3.7) that

Equating the coefficients of $q^{n}$
on both sides of (3.8), we arrive at (3.4). This completes the proof.
4. Overpartitions
The objective of this section is to provide a proof of Theorem 1.3 and present its corollary.
4.1. Proof of Theorem 1.3
Taking $a=q^{2r-1}$
and $c=-q^{r}$
in (2.10) and then multiplying both sides by $(q;q)_{2r-1}$
yields

In view of (4.1),





which yields (1.16) after replacing $m$
by $k-1$
in the above identity.
Setting $a=q^{2r}$
and $c=-q^{r}$
in (2.10) then multiplying both sides by $\frac {(q;q)_{2r}}{1+q^{r}}$
, we arrive at

Therefore,





If we set $m=k-1$
in the above identity, we arrive at the desired identity (1.17). This completes the proof of Theorem 1.3.
4.2. A corollary of Theorem 1.3
In the rest of this paper, we denote by $f_j$
the multiplicity of the part $j$
in a partition and by $f_{\overline {j}}$
the multiplicity of the part $\overline {j }$
in an overpartition, i.e., $f_{\overline {j}}=0,\,1$
.
For example, from the following overpartition
we have $f_{\bar {2}}=1$
and $f_2=3$
.
We first define two partition functions $B(k,\,r,\,n)$
and $C(k,\,r,\,n)$
. Let $B(k,\,r,\,n)$
count the number of overpartitions of $n$
satisfying the following conditions:
(1) $f_{k}=k+r-1$
;(2) $f_j=0$
if $k< j < k+2r-1$
;
and let $C(k,\,r,\,n)$
count the number of overpartitions of $n$
satisfying the following conditions:
(1) $f_{x}=k$
, where $x$
is the smallest part $>k+r-1$
and $x$
exists;(2) $f_j=0$
if $k\leq j\leq x+r-1$
and $j\neq x$
;(3) $f_{\overline {j}}=0$
if $k+r\leq j \leq x$
.
For instance, $B(3,\,2,\,16)=11$
since there are 11 such partitions:

Moreover, $C(3,\,2,\,16)=2$
since the two partitions in questions are
Note that the generating function for $B(k,\,r,\,n)$
is

Let $x=k+r+n-1$
for some positive integer $n$
. Then the generating function for $C(k,\,r,\,n)$
is

By Theorem 1.3, we deduce the following corollary.
Corollary 4.1 Let $r$
be a positive integer and define
Then for $k\geq 1$
and $n> \frac {r(r-1)}{2}$
,


For instance, if we set $r=2$
and $k=3$
in Corollary 4.1, we find that for $n\geq 1$
,

If $n=16$
, we have

and

Now, we turn to prove Corollary 4.1.
Proof. In view of (1.16), (1.20), and (4.3)–(4.5),

which yields (4.7) after equating the coefficients of $q^{n}$
on both sides of (4.9).
Moreover, thanks to (1.17), (1.20), (4.4), and (4.6),

Equating the coefficients of $q^{n}$
on both sides of (4.10), we get the desired identity (4.8). The proof is complete.
5. Partitions with odd part distinct
The aim of this section is to prove Theorem 1.4 and present a corollary.
5.1. Proof of Theorem 1.4
Setting $(q,\,a,\,c) \rightarrow (q^{2},\,q^{4r-2},\,-q^{2r-1})$
in (2.10) and then multiplying both sides by $\frac {(q^{2};q^{2})_{2r-1}}{1+q^{2r-1}}$
yields

Thanks to (5.1),





which yields (1.18) after replacing $m$
by $k-1$
in the above identity.
Taking $(q,\,a,\,c)=(q^{2},\,q^{4r},\,-q^{2r+1})$
in (2.10) and then multiplying both sides by $(q^{2};q^{2})_{2r}$
yields

In view of (5.2),





If we replace $m$
by $k-1$
in the above identity, we get the desired identity (1.19). This completes the proof.
5.2. A corollary of Theorem 1.4
In order to state our corollary, we first define some partition functions.
Let $D(k,\,r,\,n)$
count the number of partitions of $n$
satisfying the following conditions:
(1) $f_{x}=k$
, where $x$
is the smallest part $\geq 2k+2r-1$
, and $x$
is odd and exists;(2) $f_{2j+1}=0$
or $1$
if $1\leq 2j+1 \leq 2k+2r-3$
or $2j+1>x$
;(3) $f_{2j}=0$
if $2k\leq 2j \leq x+2r-3$
.
For example, $D(2,\,2,\,21)=5$
since the five partitions in questions are
Let $x=2k+2r+2n-1$
for some integer $n\geq 0$
. Then the generating function for $D(k,\,r,\,n)$
is

Next, define $E(k,\,r,\,n)$
to be the number of partitions of $n$
satisfying the following conditions:
(1) $f_{2k+2r-1}=k$
or $\ k+1$
;(2) $f_{2j+1}=0$
or $1$
if $j\neq k+r-1$
;(3) $f_{2j}=0$
if $k\leq j\leq k+2r-1$
.
For instance, $E(2,\,2,\,21)=4$
because the four partitions in questions are
It is easy to see that the generating function for $E(k,\,r,\,n)$
is

Finally, let $F(k,\,r,\,n)$
count the number of partitions of $n$
satisfying the following conditions:
(1) $f_{x}=k$
, where $x$
is the smallest part $>2k+2r-1$
, and $x$
is odd and exists;(2) $f_{2j+1}=0$
or $1$
if $1\leq 2j+1 \leq 2k+2r-1$
or $2j+1>x$
;(3) $f_{2j+1}=0$
if $2k+2r+1\leq 2j+1 < x$
;(4) $f_{2j}=0$
if $2k\leq 2j \leq x+2r-1$
.
For instance, $F(2,\,2,\,21)=2$
since the two partitions in questions are
Let $x=2k+2r+2n-1$
for some positive integer $n$
. Then the generating function for $F(k,\,r,\,n)$
is

Corollary 5.1 Let $r$
be a positive integer and define
Then for $k\geq 1$
and $n> r^{2}$
,


For instance, if $k=2$
and $r=2$
, we find that for $n\geq 4$
,

and

If $n=21$
, then
and
To conclude this section, we present a proof of Corollary 5.1.
Proof of Corollary 5.1 It follows from (1.18), (1.21), (5.3), and (5.6) that

which yields (5.8) after equating the coefficients of $q^{n}$
on both sides of the above identity.
Similarly, in light of (1.19), (1.21), (5.4), (5.5), and (5.7) that

Equating the coefficients of $q^{n}$
on both sides of (5.10), we arrive at (5.9). This completes the proof.
6. Concluding Remarks
In this paper, based on a Bailey pair given by Lovejoy [Reference Lovejoy15], we present a unified treatment to establish new truncated theorems on the three classic theta function identities due to Euler and Gauss. From those theorems, we can present partition-theoretic interpretations for the alternating sums in (3.4), (4.7), (4.8), (5.8), (5.9) and deduce infinite families of linear inequalities on the three classical partition functions $p(n)$
, $\overline {p}(n)$
and $pod(n)$
. We also remark that (1.9) can be deduced from (2.10). If we take $a\rightarrow 1$
in (2.10), we have

Setting $c=-1$
in (6.1) yields

Utilizing (6.2) and the method for proving (1.16), we can deduce (1.9). In addition, setting $a\rightarrow 1$
in (3.1) yields

Employing (6.3) and the method for proving (1.15), we prove that for $k\geq 1$
,

The above identity implies that for $k\geq 1$

where $\widehat {P}_k(n)$
is the number of partitions of $n$
in which $k$
is the least integer such that every part $< k$
appears at least once and there are more parts $>k-1$
than there are $< k$
. This solves an open problem given by Merca [Reference Merca18].
Andrews–Merca [Reference Andrews and Merca3] and Guo–Zeng [Reference Guo and Zeng11] posed the following conjecture: -
conjecture Let $m,\, r$
be positive integer with $r \leq m/2$
and define

Then for $n\geq 1$
and $k\geq 1$
,

with strict inequality if $n \geq k(mk +m-2r)/2$
.
This conjecture was settled by Mao [Reference Mao16] and Yee [Reference Yee32] independently, and then it was reproved by Wang and Yee [Reference Wang and Yee26] later.
Setting $(m,\,r)=(3,\,1)$
, and $(m,\,r)=(2,\,1)$
in (6.4), respectively, we get the following inequalities on $p(n)$
and $\overline {p}(n)$
:

and

In fact, inequality (6.5) is a consequence of (1.3) which was first proved by Andrews and Merca [Reference Andrews and Merca3]. In [Reference Xia, Yee and Zhao29], Xia et al. proved that for $n\geq 1$
and $k\geq 1$
,


which are stronger than (6.5) and (6.6). So it would be interesting if one can find an inequality which is stronger than (6.4) for general positive integers $m$
and $r$
with $1\leq r \leq m/2$
.
Acknowledgements
The author cordially thanks the anonymous referee for his/her helpful comments. This work was supported by the Natural Science Foundation of Jiangsu Province of China (no. BK20221383) and the National Natural Science Foundation of China (no. 11971203).
Declaration of competing interest
The author declares no conflicts of interest to this work.