Abstract
We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we show that for \(L\ge 1\), the number of partitions with \(ls \le L\) and \(s=1\) is greater than the number of partitions with \(ls\le L\) and \(s>1\). Here l and s are the largest part and the smallest part of the partition, respectively.
Introduction
Let \(\pi = (1^{f_1},2^{f_2},\dots )\) be a sequence, where all exponents \(f_i \in {\mathbb {Z}}_{\ge 0}\) and all but finitely many of them are zero. We call \(\pi \) a partition (shown in frequency representation [2]), where the exponents \(f_i\) are the number of occurrences of i. The numbers i with nonzero frequencies in \(\pi \) are called parts of \(\pi \). Since there are only finitely many nonzero frequencies in a partition \(\pi \), the sum
is finite. This sum, \(\pi \), is called the norm of the partition \(\pi \). To shorten the notation, one can ignore the zero frequencies; we keep the option of writing any zero frequencies that need emphasizing. As an example \(\pi = (1^4, 3^2,4^0,10^1)\) is a partition of 20 (meaning \(\pi  = 20\)), where 1 appears as a part with frequency 4, 3 appears twice, 4 is not a part, and part 10 only appears once in \(\pi \). The partition where all the frequencies are equal to zero is a conventional and unique partition of 0.
Let \(\delta _{i,j}\) be the standard Kronecker delta function yielding 1 for \(i=j\), and vanishing otherwise. We define sets \({\mathcal {A}}_{L,1}\) and \({\mathcal {A}}_{L,2}\) for integers \(L\ge 1\).

(i)
Let \({\mathcal {A}}_{L,1}\) be the set of partitions with the smallest part being 1, where all the parts \(\le L+1\) and \(f_L = \delta _{L,1}\),

(ii)
and let \({\mathcal {A}}_{L,2}\) be the set of nonempty partitions where the parts are in the domain \(\{2,3,\dots , L+1 \}\).
These sets satisfy the following relation.
Theorem 1.1
For any \(L\ge 2\) and \(N\ge 1 \),
Elementary combinatorial inequalities, such as (1.1), have interesting implications for qseries and the theory of partitions. This simple observation about the magnitude of sets, in this case, implies nonnegativity results for a refinement of an earlier discussedweighted partition identity result [10]. We introduce that result and its refinement here.
Let \(\mathcal {U}\) be the set of partitions with positive norm. We define some natural partition statistics. Let

(i)
\(s(\pi )\) denote the smallest part of the partition \(\pi \),

(ii)
\(l(\pi )\) denote the largest part of \(\pi \),

(iii)
\(\nu (\pi ):= \sum _{i\ge 1} f_i\) denote the total number of parts in \(\pi \),

(iv)
\(r(\pi ):=l(\pi )\nu (\pi )\), rank of \(\pi \).
In [10], we introduced a new partition statistic \(t(\pi )\) to be the number defined by the properties

(i)
\(f_i\equiv 1\mod 2\), for \(1\le i\le t(\pi )\),

(ii)
\(f_{t(\pi )+1}\equiv 0 \mod 2\).
Note that for any \(\pi \in \mathcal {U}\) with an even frequency of 1 (where \(f_1\) might be 0) we have \(t(\pi )=0\). We will refer to \(t(\pi )\) as the length of the initial oddfrequency chain. With this new statistic, the authors have proven a new combinatorial identity of partitions.
Theorem 1.2
We have
This generating function identity can be articulated easily as a combinatorial correspondence as follows:
The total count of partitions of a positive integerN, counted with the weight 1 if the smallest part is odd, and\(1\)if the smallest part is even, is the same as the total of all oddfrequency chain lengths of partitions ofN.
One example of Theorem 1.2 is given in Table 1.
We define nonnegativity of a series
if for all n, \(a_n\ge 0\), where q is a formal summation variable. We denote the nonnegativity by the notation
One important observation about Theorem 1.2 is that the statistic \(t(\pi )\) is nonnegative for any partition \(\pi \). It is clear that
where \(p_t(n)\) is the total weighted count of partitions with the t statistic. This implies that the series in (1.2) is nonnegative. Written in analytic form, the identity (1.2) is equivalent to
where
The left side of (1.3) is not manifestly nonnegative due to the \(1/(1+q^n)\) factors appearing in the summands, but the series on the right side (which is related to the \(t(\pi )\) statistic) shows the nonnegativity, as expected.
In this work, we introduce a refinement of Theorem 1.2 where we put a bound on the difference between the largest and the smallest parts of partitions. We prove that
Theorem 1.3
for \(L\ge 1\),
We remark that for \(L=0\), the righthand side becomes
Although Theorem 1.3 does not apply for this case, it is easy to conclude that
Interested readers are invited to examine [4, 12], and [11] for other studies on bounded differences between largest and smallest parts.
Section 2 has a short repertoire of basic hypergeometric identities that will be referred to later. In Sect. 3, we are going to prove two inequalities between sets of partitions (Theorem 1.1 and an analogue) using only injections between sets, and later state some related open questions. We will state the analytic versions of some of the theorems of Sect. 3 and their implications in Sect. 4. We later will use the complements of the range of the injective maps of Sect. 3 to get new qseries summation formulas. Theorem 1.3 will be proven in Sect. 5. Section 6 has an excursion in different representations and an observably nonnegative expression for the analytic expression of (1.4) of Theorem 1.3. An outlook section finishes the paper with a summary of open questions that arise from this study.
Some qHypergeometric Identities
Some qhypergeometric functions and some of their related formulas that will be used later are stated here. Let r and s be nonnegative integers and \(a_1,a_2,\dots ,a_r,b_1,b_2,\dots ,b_s,q,\) and z be variables. Then
Let a, b, c, q, and z be variables. The qbinomial theorem [13, II.3, P. 236] is
All three Heine transformations [13, III.1–3, P. 241] are
The Jackson transformation [13, III.4, P. 236] is
Two New Partition Inequalities
We start our discussion with a proof of Theorem 1.1. Recall
Theorem 1.1 For any \(L\ge 2\) and \(N\ge 1 \),
Note that the claimed inequality of Theorem 1.1 is not true for \(L=1\) as the set \({\mathcal {A}}_{1,1}\) only has partitions of type \((1^1,2^{f_2})\) and \({\mathcal {A}}_{1,2}\) only has partitions of type \((2^{1+f_2})\). Hence, \({\mathcal {A}}_{1,1}\) has a single partition for every odd norm and \({\mathcal {A}}_{1,2}\) has a single partition for every even norm and nothing else, making the inequality claim of (1.1) impossible for this case.
For \(L\ge 2\), we prove the inequality (1.1) in an injective manner.
Proof of Theorem 1.1
First, we handle the \(L=2\) case with the injection \(\gamma ^*:{\mathcal {A}}_{2,2}\rightarrow {\mathcal {A}}_{2,1}\). Let \(\pi =\big (2^{f_2},3^{f_3}\big )\in {\mathcal {A}}_{2,2}\), then

(i)
if \(f_2>0\), then \(\gamma ^*(\pi ) = \big (1^{2f_2},2^0,3^{f_3}\big )\),

(ii)
if \(f_2=0\) and \(f_3>0\), then \(\gamma ^*(\pi ) = \big (1^{3},2^0,3^{f_31}\big )\).
The parity of the frequency of 1 in the image clearly determines the case. Hence, \(\gamma ^*\) is an injection demonstrating (1.1) for \(L=2\).
For \(L\ge 3\), let
be a partition from the set \({\mathcal {A}}_{L,2}\). Define
by the following cases:

(i)
if \(2< s(\pi ) <L+1\), then
$$\begin{aligned}&\gamma (\pi ) = \big (1^{[(f_L\delta _{L,s(\pi )})\cdot L + 1]},(s(\pi )1)^{1},s(\pi )^{f_{s(\pi )}1},\dots , L^{0},(L+1)^{f_{L+1}}\big ), \end{aligned}$$ 
(ii)
if \(s(\pi ) = L+1\), then \(\gamma (\pi ) = \big (1^{L+1},(L+1)^{f_{L+1}1}\big )\),

(iii)
if \(s(\pi ) = 2\), then \(\gamma (\pi ) = \big (1^{(f_L\cdot L + 2)},2^{f_21},\dots , L^{0},(L+1)^{f_{L+1}}\big )\).
The image of a partition \(\pi \in {\mathcal {A}}_{L,2}\) is uniquely defined. The remainder of the frequency \(f_1\) divided by L in the image is either 1 or 2. The remainder 2 comes from a unique case. In the remainder being 1 case, one can uniquely identify the preimage by looking at the smallest part size that is greater than 1. This proves that \(\gamma \) is an injection and it is enough to show (1.1). \(\square \)
The interested reader is invited to examine [3, 6,7,8,9] and [14] for other examples of injective combinatorial arguments and inequalities between the sizes of sets of partitions.
We exemplify Theorem 1.1 with Table 2 by writing out the related partitions.
We can shift the permissible parts of the sets \({\mathcal {A}}_{L,i}\) up by one and also get a similar result to Theorem 1.1. Let \(L\ge 1\) be an integer and define

(i)
\({\mathcal {B}}_{L,1}\) to be the set of partitions such that the smallest part is 2, all the parts are \(\le L+2\) and \(f_{L+1} = \delta _{L,1}\),

(ii)
\({\mathcal {B}}_{L,2}\) to be the set of nonempty partitions where the parts are in the domain \(\{3,4,\dots ,L+2 \}\).
Then we have
Theorem 3.1
For any \(L\ge 3\) and \(N\ge 1 \),
Before the proof of Theorem 3.1, we examine the excluded initial cases of L. In the case \(L=1\), \({\mathcal {B}}_{1,1}\) is the set of partitions of type \(\big (2^1,3^{f_3}\big )\). Hence, all partitions of \({\mathcal {B}}_{1,1}\) have norm 2 modulo 3. The set \({\mathcal {B}}_{1,2}\) contains partitions only of the type \(\big (3^{1+f_3}\big )\), which 0 modulo 3 norm. Therefore, the inequality (3.1) cannot hold for all N. The sets \({\mathcal {B}}_{2,1}\) and \({\mathcal {B}}_{2,2}\) contain partitions exclusively of the type \(\big (2^{1+f_2},4^{f_4}\big )\) and \(\big (3^{f_3},4^{f_4}\big )\) with \(f_3+f_4>0\), respectively. It is easy to see that all the partitions in \({\mathcal {B}}_{2,1}\) have even norms, but for any \(k\ge 0\), there are partitions of odd norm \(4k+3\) in \({\mathcal {B}}_{2,2}\). Therefore, for \(L=2\), the inequality (3.1) does not hold for all N either.
Proof of Theorem 3.1
We begin our proof with the \(L=3\) case. Let \(\pi = \big (3^{f_3},4^{f_4},5^{f_5}\big )\) be a partition in \({\mathcal {B}}_{3,2}\), with norm \(> 3\). Let \(\Gamma _1^*\) be the map from \({\mathcal {B}}_{3,2}\) to \({\mathcal {B}}_{3,1}\) as follows:

(i)
if \(f_4 >0\), then \(\pi \mapsto \big (2^{2f_4}, 3^{f_3},5^{f_5}\big )\),

(ii)
if \(f_3=f_4=0\), then \(f_5>0\) and define \(\pi \mapsto \big (2^1,3^1,5^{f_51}\big )\),

(iii)
if \(f_4=0\) and \(f_3>1\), then \(\pi \mapsto \big (2^3,3^{f_3 2},5^{f_5}\big )\),

(iv)
if \(f_4=0\) and \(f_3=1\), since \(\pi >3\), \(f_5>0\), then \(\pi \mapsto \big (2^1,3^{2},5^{f_51}\big )\).
This case by case map \(\Gamma _1^*\) can easily be seen to be an injection. In Cases (i) and (iii), the frequency of 2 as a part in the image is the signature, and in the other cases, the frequency of 3 becomes our signature. This distinguishes all the cases from each other. Finally, we note that \({\mathcal {B}}_{L,1}\) does not have a partition with norm \(N=3\) whereas (3) is a partition of \({\mathcal {B}}_{L,2}\) for all \(L\ge 3\). This single discrepancy is corrected with the term \(\delta _{N,3}\) in the inequality (3.1).
Let \(\pi = \big (3^{f_3},\dots ,(L+2)^{f_{L+2}}\big )\) be a partition in \({\mathcal {B}}_{L,2}\), with norm \(> 3\). For \(L=2m1\ge 5\), we define the injective map \(\Gamma _1\) as follows:

(i)
If \(f_{L+1}=f_{2m}>0\), then \(\pi \mapsto \big (2^{f_{2m}\cdot m},3^{f_3},\dots , (L+1)^0, (L+2)^{f_{L+2}}\big )\),

(ii)
if \(\exists i\in \{2,\dots , m1\}\) such that \(f_{2i}>0\) and \(f_{2j}=0\), \(\forall j> i\), then
$$\begin{aligned}&\pi \mapsto \big (2^{i},3^{f_3},\dots ,(2i)^{f_{2i}1},\\&\quad (2i+1)^{f_{2i+1}},(2i+2)^0,\dots ,(L+1)^0, (L+2)^{f_{L+2}}\big ), \end{aligned}$$ 
(iii)
if \(\forall i \in \{2,\dots , m\}\), \(f_{2i}=0\) and \(s(\pi )\) is odd \(> 3\), then
$$\begin{aligned} \pi \mapsto \big (2^{1},(s(\pi )2)^1,(s(\pi )1)^0,s(\pi )^{f_{s(\pi )}1},\dots \big ), \end{aligned}$$ 
(iv)
if \(\forall i \in \{2,\dots , m\}\), \(f_{2i}=0\) and \(f_3\ge 2\), then \(\pi \mapsto \big (2^{1},3^{f_32},4^1,5^{f_5},\dots \big )\),

(v)
if \(\forall i \in \{2,\dots , m\}\), \(f_{2i}=0\) and \(f_3=1\), then since \(\pi >3\) there is a smallest positive \(j>1\) such that \(f_{2j+1}>0\), then \(\pi \mapsto \big (2^{1},(j+1)^2,(2j+1)^{f_{2j+1}1},\dots \big ).\)
The map \(\Gamma _1\) for odd \(L \ge 5\) is injective as the number of occurrences of 2, if larger than 1, specifies the case and if 2 appears only once in the image then the following smallest parts specify the case.
One can also view \(\Gamma _1^*\) for \(L=3\) as a derivation of \(\Gamma _1\). We use the Cases (i), (iii) and (v) of \(\Gamma _1\) as they are and modify the Case (iv) as \(\pi \mapsto \big (2^3,3^{f_32},5^{f_5}\big )\). The Case (ii) of \(\Gamma _1\) does not apply for \(L=3\).
Now we define the map \(\Gamma _2^*\) for \(L=4\). Let \(\pi = \big (3^{f_3},4^{f_4},5^{f_5},6^{f_6}\big )\) with \(\pi \not =3\). Then the map \(\Gamma _2^*\) sends \(\pi \) to the following images depending on the following cases:

(i)
if \(f_5\) is positive even, then \(\pi \mapsto \big (2^{(f_5/2)5},3^{f_3},4^{f_4},5^{0},6^{f_6}\big )\),

(ii)
if \(f_5\) is positive odd and if \(f_3>0\), then \(\pi \mapsto \big (2^{((f_51)/2)5+4},3^{f_31},4^{f_4},5^{0},6^{f_6}\big )\),

(iii)
if \(f_5\) is positive odd and if \(f_3{=}0\), then \(\pi \mapsto \big (2^{((f_51)/2)5+1},3^{1},4^{f_4},5^{0},6^{f_6}\big ),\)

(iv)
if \(f_5=0\),

(1)
and \(f_6>0\), then \(\pi \mapsto \big (2^{3},3^{1},4^{f_4},5^{0},6^{f_61}\big )\),

(2)
or \(f_6=0\) and \(f_4>0\), then \(\pi \mapsto \big (2^{2},3^{1},4^{f_41},5^{0},6^{0}\big )\),

(1)

(v)
if \(f_4=f_5=f_6=0\), since \(\pi \not = 3\),

(1)
either \(f_3=2\), then \(\pi \mapsto \big (2^{1},3^{0},4^{1},5^{0},6^{0}\big )\),

(2)
or \(f_3 \ge 3\), then \(\pi \mapsto \big (2^{1},3^{f_32},4^{1},5^{0},6^{0}\big )\).

(1)
The partitions (4, 5) and \((3^3)\) in \({\mathcal {B}}_{4,2}\) both get mapped to (2, 3, 4), which is a source of the extra correction term of size 1, for \(N=9\). Other than this explained issue, all the images of \(\Gamma _2^*\) can easily be classified and the inverse images can be found by looking at the frequency of 2 modulo 5. If the frequency of 2 is exactly one, then the frequency of 3 determines the case and subcase the image is coming from. This injective map can be generalized for larger even L. We define \(\Gamma _2\) for all even \(L= 2m \ge 6\). Let \(\pi = \big (3^{f_3},\dots ,(L+2)^{f_{L+2}}\big )\) be a partition in \({\mathcal {B}}_{L,2}\), with norm \(> 3\):

(i)
if \(f_{L+1}=f_{2m+1}\) is positive even, then
$$\begin{aligned} \pi \mapsto \big (2^{(f_{2m+1}/2)(2m+1)},3^{f_3},\dots , (L+1)^0, (L+2)^{f_{L+2}}\big ), \end{aligned}$$ 
(ii)
if \(f_{2m+1}\) is positive odd and if \(\exists k \in \{2,\dots ,m\}\) with \(f_{2k1}>0\), where \(\forall k<j<m+1\), \(f_{2j1}=0\), then
$$\begin{aligned}&\pi \mapsto \big (2^{[(f_{2m+1}1)/2](2m+1) + (m+k)},\dots ,\\&\quad (2k1)^{f_{2k1}1},\dots ,(L+1)^0, (L+2)^{f_{L+2}}\big ), \end{aligned}$$ 
(iii)
if \(f_{2m+1}\) is positive odd and \(\forall k \in \{2,\dots ,m\}\), \(f_{2k1}=0\), then
$$\begin{aligned}&\pi \mapsto \big (2^{[(f_{2m+1}1)/2](2m+1) + 1}, \dots ,\\&\quad (2m1)^{1},(2m)^{f_{2m}},(L+1)^0, (L+2)^{f_{L+2}}\big ), \end{aligned}$$ 
(iv)
if \(f_{2m+1}=0\), and there exists the largest integer \(k \in \{2,\dots ,m +1\}\) such that \(f_{2k} >0\), then \(\pi \mapsto \left( 2^{k},3^{f_3}, \dots ,(2k)^{f_{2k}1},\dots \right) ,\)

(v)
if \(f_{2m+1}=0\), and \(\forall k \in \{2,\dots ,m +1\}\), \(f_{2k} = 0\) and if \(f_3=1\), then since \(\pi >3\) there exists the smallest positive integer \(i>1\) such that \(f_{2i+1}>0\), then \(\pi \mapsto (2^{1},(i+1)^2,(2i+1)^{f_{2i+1}1},\dots )\),

(vi)
if \(f_{2m+1}=0\), and \(\forall k \in \{2,\dots ,m +1\}\) such that \(f_{2k} = 0\) and if \(f_3>1\), then \(\pi \mapsto \big (2^{1},3^{f_32},4^1,\dots \big )\),

(vii)
if \(f_{2m+1}=0\), and \(\forall k \in \{2,\dots ,m +1\}\) such that \(f_{2k} = 0\) and if \(f_{3}=0\) then there exists the smallest integer \(m>i>1\) such that \(f_{2i+1}>0\), then \(\pi \mapsto \big (2^{1},(2i1)^1,(2i+1)^{f_{2i+1}1},\dots \big )\).
The injection \(\Gamma _2\), just like \(\Gamma _1\), has no problem in separating the cases when \(f_2 \not = 1\) in the image of partitions. The \(f_2=1\) cases in the image can be identified uniquely by the second and third smallest parts and their frequencies. The condition \(L \ge 6\) or equivalently \(m\ge 3\) is used implicitly as it is necessary for Case (vii) to be defined.
For the \(L=4\) case, our injection \(\Gamma _2^*\) for partitions \(\pi \) with norm not equal to 3 or 9 can be related with \(\Gamma _2\), where we use Cases (i)–(iv) and (vi) with \(m=2\), where Case (vi) comes with the extra assertion that \(f_32 \not = 1\).
\(\square \)
An example of Theorem 3.1 is given in Table 3.
Theorems 1.1 and 3.1 are intriguing and can also be viewed as the initial stages of a more general conjecture. Define the following sets:

(i)
\({\mathcal {C}}_{L,s,1}\) denotes the set of partitions where the smallest part is s, all the parts are \(\le L+s\) and \(L+s1\) does not appear as a part,

(ii)
\({\mathcal {C}}_{L,s,2}\) denotes the set of nonempty partitions where the parts are in the domain \(\{s+1,\dots ,L+s \}\).
Conjecture 3.2
For given positive integers \(L\ge 3\) and s, there exists M, which only depends on s, such that
for all \(N\ge M\).
The first two initial families of cases for \(s=1\) and 2 are Theorems 1.1 and 3.1 with \(M=1\) and \(M=10\). It should be noted that in a case when L tends to \(\infty \), this conjecture is nothing but a tautology.
In the definition of \({\mathcal {B}}_{L,i}\), we shifted the permissible part sizes of \({\mathcal {A}}_{L,i}\) up by one. Another route to take would be shifting the sets, but keeping the impermissible part L of \({\mathcal {A}}_{L,i}\) the same. For \(L\ge s+1\), let \({\mathcal {C}}^*_{L,s,1}\) be the set of partitions where the smallest part is s, all the parts are \(\le L+s\) and L does not appear as a part.
Similar to Conjecture 3.2, we also claim that
Conjecture 3.3
For given positive integers \(L \ge 3\) and s, there exists M, which only depends on s, such that
for all \(N\ge M\).
In Sect. 7, we will be reiterating these conjectures and state their analytic versions.
Some Analytic Nonnegativity Results
Theorems 1.1 and 3.1 lead to new nonnegativity results and some new summation formulas. The analytic analogue of Theorem 1.1 is the following:
Theorem 4.1
For \(L\ge 2\),
We can, and will, extend the definition of \(H_{L,1}(q)\) for \(L=1\) case, but in this case, the expression simplifies to \(q/(1+q)\) and is not nonnegative.
Proof of Theorem 4.1
All we need to point out is that
is the generating function for the number of partitions from the set \({\mathcal {A}}_{L,1}\) and that
is the generating function for the number of partitions from the set \({\mathcal {A}}_{L,2}\). Theorem 1.1 proves the nonnegativity assertion for \(H_{L,1}(q)\), where \(L\ge 2\).
\(\square \)
We note that any expression of the following form is nonnegative
for any \({\mathcal {I}}\subset {\mathbb {N}}\). The first term can be thought as the generating function for the partitions with parts in the set \({\mathcal {I}}\) and the \(1\) term can be interpreted as taking away the empty partition from the calculations. This type of “reciprocal product take away one” expressions of the form (4.2) will appear in our future calculations, and they are always going to be nonnegative by this observation.
The coefficients of \(H_{1,1}(q) = q/(1+q)\) are consistent with our earlier observations about the \({\mathcal {A}}_{1,1}\) and \({\mathcal {A}}_{1,2}\), which came immediately before the proof of Theorem 1.1. In general, we can write \(H_{L,1}(q)\) abstractly, as the difference of generating functions. For any nonnegative integer L,
Now that we know the relation between the injections \(\gamma ^*\), and \(\gamma \) defined in the proof of Theorem 1.1 and \(H_{L,1}(q)\), we can find an alternative expression for \(H_{L,1}(q)\) by considering the elements of \({\mathcal {A}}_{L,1}\) that are not an image of these injections. For \(L=2\), it is clear that the partitions of type

(i)
\(\big (1^1,2^0,3^{f_3}\big )\), where \(f_3\) is a nonnegative integer,

(ii)
\(\big (1^{2j+5},2^0,3^{f_3}\big )\) for j and \(f_3\) nonnegative integers
are the elements of \({\mathcal {A}}_{2,1}\), which are not in the range of \(\gamma ^*\). The generating functions of such partitions can be easily written as
Let \(L\ge 3\), given a partition \(\pi \in {\mathcal {A}}_{L,1} {\backslash } \gamma ({\mathcal {A}}_{L,2})\), \(\pi \) can have one of the following three forms:

(i)
for \(2< s < L+1\), \(\big (1^{tL+1},(s1)^{k+2},\dots ,L^0,(L+1)^{f_{L+1}}\big )\), where t and k are nonnegative integers,

(ii)
\(\big (1^{kL+1},L^0,(L+1)^{f_{L+1}}\big )\), where \(k \ge 2\) or 0,

(iii)
\(\big (1^{kL+r},\dots ,L^0,(L+1)^{f_{L+1}}\big )\), where \(r\in \{3,\dots ,L\}\) and k is a nonnegative integer.
The generating functions for these cases are given by the first term, the following two, and the last term in the following expression for \(L\ge 3\), respectively,
This alternative formula (4.4) can be shortened a little by combining the first two terms and rewriting the last:
One important note about (4.5) is that it is written with manifestly nonnegative terms. In fact, this formula can be checked to be valid for \(L=1\) and 2 (consistent with (4.3)) as well, even though the \(\gamma \) map is not defined for these cases.
Equating (4.1) and (4.5) yields the formula using combinatorial means only.
Theorem 4.2
For a positive integer L,
A direct proof can also be given.
Proof of Theorem 4.2
We start by noting
Observe that
This is because the lefthand side sum is the generating function for the number of nonzero partitions \(\pi \) into distinct parts \(\le L\) with weights \((1)^{\nu (\pi )1}\) written with respect to the largest part of the partitions. Now, it is easy to justify
By dividing both sides by \(q/(q;q)_{L+1}\), and doing the necessary simplifications, one can finish the proof. \(\square \)
Taking the limit \(L\rightarrow \infty \) in (4.6), it is easy to get:
Corollary 4.3
One can also give a direct qhypergeometric proof of Corollary 4.3. This proof amounts to using the second Heine transformation (2.3) followed by the qbinomial theorem (2.1).
Similar to Theorems 1.1, 3.1 also has a qtheoretic equivalent.
Theorem 4.4
For \(L\ge 3\),
Proof
For \(L\ge 3\), the generating functions for the number of partitions coming from the sets \({\mathcal {B}}_{L,1}\) and \({\mathcal {B}}_{L,2}\) are
respectively. The correction terms for norm 3 and the one time correction term for norm 9 cases are also added analogous to (3.1). Theorem 3.1 proves the claimed nonnegativity. \(\square \)
The \(H_{L,2}(q)\) can be extended to the positive integers and, in general, can be written as a difference of generating functions with two extra factors as
The initial cases of \(H_{L,2}\) are as follows
which clearly show that Theorem 4.4 fails for \(L=1\) and 2.
Similar to the treatment of the injection \(\gamma \) after Theorem 4.1, one can look for the partitions that are outside of the image of \(\Gamma ^*_1\), \(\Gamma _1\), etc. and write the (4.8) expression with manifestly nonnegative terms. Yet, the increase in the number of cases are making this study not necessarily harder, but messier.
Considering partitions outside of the image of \(\Gamma ^*_1\), defined in the proof of Theorem 3.1, for \(L=3\) case implies the summation formula:
where the partitions in \({\mathcal {B}}_{3,1} {\backslash } \Gamma ^*_1({\mathcal {B}}_{3,2})\) are of the form

(i)
\(\big (2^{2j+5},3^{f_3},5^{f_5}\big )\), where j is a nonnegative integer,

(ii)
or \(\big (2^1,3^{f_3},5^{f_5}\big )\), where \(f_3 \ge 3\),

(iii)
or \(\big (2^1,5^{f_5}\big )\),
according to the three summation terms on the righthand side of (4.9). Recall that \(f_i\) is nonnegative for any i. For larger odd L values that fall under the injective map \(\Gamma _1\), we can repeat this process and write \(H_{L,2}\) as a sum of manifestly nonnegative terms. Needless to say, \(f_{L+1}=0\) in these cases. The partitions in \({\mathcal {B}}_{L,1} {\backslash } \Gamma _1({\mathcal {B}}_{L,2})\), for odd \(L>3\), are ones of the form:

(i)
\(\left( 2^{i+k(L+1)/2},3^{f_3},\dots ,(L+1)^0, (L+2)^{f_{L+2}}\right) \), where \((L1)/2\ge i \ge 2\) and \(k~+~\sum _{j=i+1}^{(L1)/2}~f_{2j}~>~0\),

(ii)
\(\left( 2^{1+k(L+1)/2},(L+2)^{f_{L+2}}\right) \), where k is a nonnegative integer,

(iii)
\(\left( 2^{1+k(L+1)/2}, s^{3+f_s},\dots ,(L+1)^0 ,(L+2)^{f_{L+2}}\right) \), where \(L\ge s\ge 4\),

(iv)
\(\left( 2^{1+k(L+1)/2}, s^2,\dots ,(L+1)^0 ,(L+2)^{f_{L+2}}\right) \), where \(L \ge s\ge (L+5)/2\),

(v)
\(\left( 2^{1+k(L+1)/2}, s^2,\dots ,(L+1)^0 ,(L+2)^{f_{L+2}}\right) \), where \((L+3)/2 \ge s\ge 4\) and
$$\begin{aligned} k + \sum _{j=s+1}^{2s2}f_j+\sum _{j=s}^{(L1)/2}f_{2j}>0, \end{aligned}$$ 
(vi)
\(\left( 2^{1+k(L+1)/2}, s^1,\dots , (L+1)^0,(L+2)^{f_{L+2}}\right) \), where s is odd and \(L\ge s\ge ~5\),
$$\begin{aligned} k+\sum _{j=(s+1)/2}^{(L1)/2} f_j>0, \end{aligned}$$ 
(vii)
\(\left( 2^{1+k(L+1)/2}, s^1,\dots ,(L+1)^0,(L+2)^{f_{L+2}}\right) \), where \((L1)/2\ge s>4\) even,

(viii)
\(\left( 2^{1+k(L+1)/2},4^1,\dots ,(L+1)^0,(L+2)^{f_{L+2}}\right) \), where \(k+\sum _{j=3}^{(L1)/2}f_{2j}>0\),

(ix)
\(\left( 2^{1+k(L+1)/2},3^{1+f_3},4^{2+f_4},\dots ,(L+1)^0,(L+2)^{f_{L+2}}\right) \),

(x)
\(\left( 2^{1+k(L+1)/2},3^{1+f_3},4^{\alpha },\dots ,(L{+}1)^0,(L{+}2)^{f_{L+2}}\right) \), where \(k+\sum _{j=3}^{(L1)/2}f_{2j}{>}0\) and \(\alpha =0\) or 1,

(xi)
\(\left( 2^{1},3^{3+f_3},\dots \right) \), where \(\sum _{i=2}^{(L1)/2} f_{2i} =0\).
Using these cases, one can rewrite \(H_{L,2}(q)\) for odd \(L>3\) analytically with manifestly nonnegative generating functions (recall (4.2)):
On the righthand side of (4.10), the kth term is the generating function for the number of partitions from the kth \(\Gamma _1\) unmapped case described above, where \(k\in \{1,2,\dots ,11\}\). Also note that as L tends to infinity (4.10) simplifies significantly, and can be reduced to (4.7) after some labor.
The interested reader can also write \(H_{L,2}(q)\) with only nonnegative terms for even choices of L with the same type of argument for \(\Gamma _2^*\) and \(\Gamma _2\) injections.
An Alternative Proof of Theorems 1.2 and 1.3
We start this section by recalling Theorem 1.2:
Theorem 1.2 We have
Theorem 1.2—though proven by Jackson’s transformation in [10]—can also be proven using the analytic generating functions for the partitions into distinct parts counted with \(\pm 1\) weights depending on the parity of their ranks. Observe that
where \({\mathcal {D}}\) is the set of all partitions into distinct parts (where in a partition every frequency is either 0 or 1) with positive norm. Dividing both sides of the latter equality of (5.1) with the qfactorial \((q;q)_\infty \), the righthand side series of (5.1) becomes the righthand side of (1.3). Also recall that
The middleterm of (5.1) after the division with \((q;q)_\infty \) is the same as the middle term of (5.2). These observations together yield (1.3) and prove the Theorem 1.2. The far right series in (5.1) first arose in Ramanujan’s lost notebook and has been discussed in detail in [1, 5].
We would also like to remind the reader of the nonnegativity question:
Theorem 1.3 For \(L\ge 1\),
We define the following difference of generating functions:
The closed analytic formulations of the two generating functions on the righthand side of (5.3) can be easily explained. All the partitions counted by the first generating function,
in (5.3) has 1 as their smallest part and the largest part of these partitions can be at most \(L+1\) due to the difference condition between the largest and the smallest parts. Therefore, we have
For the second generating function of (5.3), we formulate the generating function as a sum over the number of parts. Let \(\pi \) be a partition into n parts where the smallest part \(\ge 2\). We can clearly understand that \(\pi \ge 2n\) since there are n parts and all the parts are \(\ge 2\). The whole column over the smallest part of the partition \(\pi \) is generated by the qfactor
Stripping the column of the smallest part from the far left of the Ferrers diagram of \(\pi \), we are left with a new partition with \(\le n1\) parts, where the largest part is \(\le L\). These partitions are generated by the qbinomial coefficient
Hence, putting these together, the analytic formula of the second sum in (5.3) is
Putting (5.4) and (5.5) into (5.3), we get the following formula:
We can relate the \(G_{L,1}(q)\) function with the \(H_{L,1}(q)\) and also talk about its nonnegativity.
Theorem 5.1
For \(L\ge 1\),
Proof
We start by showing the functional relation between \(G_{L,1}(q)\) and \(H_{L,1}(q)\). Comparing the righthand sides of (4.1) and (5.6), it is obvious that the first terms satisfy the claimed relation. Then the problem reduces to justifying
Observe that
Applying (5.8) and the qbinomial theorem (2.1), we can verify the formula of \(G_{L,1}(q)\):
The positivity claim on \(G_{L,1}(q)\), for \(L\ge 2\) follows from Theorem 4.1 as \(1/(1q^L)\) and \(H_{L,1}(q)\) both have nonnegative series, their multiplication has nonnegative series. The \(L=1\) case can be directly/algebraically checked from (5.6). For \(L=1\), the expression (5.6) reduces to \(q/(1q^2)\) and hence, is represented by a power series with nonnegative coefficients. \(\square \)
Theorem 5.1 implies Theorem 1.3.
Proof of Theorem 1.3
Observe that
by the original definition of \(G_{L,1}(q)\) in equation (5.3). For \(L\ge 1\), we have from Theorem 5.1. It is also clear that the second sum of (5.9),
is also nonnegative. Hence, we get our claim
\(\square \)
One can also define the analogous function
which can be written analytically as
Keeping in mind the identity (5.8) as it is used in the proof of Theorem 5.1, it is easy to prove the following theorem:
Theorem 5.2
For \(L\ge 3\),
where
With this definition, we can make a similar claim to Conjecture 3.3 about \(G_{L,2}(q)\).
Conjecture 5.3
For \(L= 3\) and 4,
and for \(L\ge 5\)
A more general analytic conjecture, which contains Conjecture 5.3, is discussed in Sect. 7.
Transformations of the Analytic Refined Weighted Identity
We now shift our focus to the analytic version of Theorem 1.3. The sum in the statement (1.4) can be written in an equivalent analytical form:
similar to the discussion of (5.5). The connection between expressions (1.4) and (6.1) is the first Heine transformation (2.2), which will be more openly discussed after the following theorem.
One can also write the last term of the righthand side of (5.9) by focusing on the smallest parts
Rewriting the terms analytically in (5.9) by plugging the expression (4.5) in (5.7), and copying (6.1) and (6.2) in their respective places yields:
Theorem 6.1
For any positive integer L, We have
Moreover, one can write the expression
qhypergeometrically. Note that
Now it is easy to see that
Applying the first Heine transformation (2.2) to this \({}_2\phi _1\), we get the qseries of (1.4).
Applying the Jackson transformation (2.5) to (6.3) gives the identity
After elementry simplifications and shifting the summation variable \(n\mapsto n1\), we arrive at the identity
The righthand side expression in (6.5), similar to (6.1), is not manifestly positive at first sight, but Theorem 1.3 carries over and proves the positivity.
Theorem 6.2
For \(L\ge 1\),
One more interesting equivalent expression to the ones of (6.5)—still not manifestly positive—is the outcome of the third Heine transformation (2.4) of the left side of (6.4). After the necessary simplifications and a shift in summation, the Heine transformation (2.4) gives
as an equal summation to that of (6.5). The expression (6.6) is interesting in its own right. It is clear that it has different summands than either side of (6.5). Yet, when \(L=0\), it matches termbyterm with the lefthand side expression
evaluated at \(L=0\), and when \(L\rightarrow \infty \), it matches termbyterm the righthand side
as \(L\rightarrow \infty \) in the identity (6.5). Therefore, to this extent, (6.6) is the intermediate term in (6.5).
Outlook
One project to pursue is to identify the statistics \(t_L(\pi )\) for partitions, which would be the refined statistics of \(t(\pi )\) of Theorem 1.2 for partitions with the difference between the largest and the smallest parts bounded by L. As it stands, going from Theorems 1.2 to 1.3 we lose grasp of the nonnegative statistic \(t(\pi )\).
Another question is related to the \(H_{L,1}(q)\) and \(H_{L,2}(q)\) functions of Sect. 4. Recall that a series \(\sum _{n\ge 0} a_n q^n\) is called eventually positive if there is some k such that \(a_n >0\) for all \(n > k\). Theorems 4.1 and 4.4 seem to be the initial steps of a eventually positive family of qproducts. Let
Then we have the following claim:
Conjecture 7.1
For positive integers \(L \ge 3\), s and \(k\ge s+1\), \(H_{L,s,k}(q)\) is eventually positive.
We have already proven the conjecture for the \((L,s,k)=(L,1,L)\) and \((L,2,L+1)\) families in Theorems 4.1 and 4.4. The particular branch \(H_{L,s,L+s1}(q)\) is a natural generalization of the functions \(H_{L,1}\) and \(H_{L,2}\) mentioned in Sect. 4, and the nonnegativity claim related to Conjecture 3.2. All other triplets with \(L=k\ge s+1\) are related to the Conjectures 3.3 and 5.3. Therefore, one can view Conjecture 7.1 with the above relations as natural extension of these observations. For all other triplets (L, s, k) are experimental.
The number of exceptional cases increases with s, making it less feasible to combinatorially study these functions for larger starting values s. More interestingly, the presence of a onetime exception at \(q^9\) for the \((L,s,k)=(4,2,5)\) case (\(H_{L,2}(q)\)), which was handled in Theorem 3.1, also hints a higher degree of underlying complexity.
References
 1.
Andrews, G.E.: Ramanujan’s “lost” notebook. V. Euler’s partition identity. Adv. in Math. 61(2), 156–164 (1986)
 2.
Andrews, G.E.: The Theory of Partitions. Reprint of the 1976 original. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1998)
 3.
Andrews, G.E.: Difference of partition functions: the antitelescoping method. In: Farkas, H.M., Gunning, R.C., Knopp, M.I., Taylor, B.A. (eds.) From Fourier Analysis and Number Theory to Radon Transforms and Geometry, pp. 1–20. Dev. Math., 28, Springer, New York (2013)
 4.
Andrews, G.E., Beck, M., Robbins, N.: Partitions with fixed differences between largest and smallest parts. Proc. Amer. Math. Soc. 143(10), 4283–4289 (2015)
 5.
Andrews, G.E., Dyson, F.J., Hickerson, D.: Partitions and indefinite quadratic forms. Invent. Math. 91(3), 391–407 (1988)
 6.
Berkovich, A., Garvan, F.G.: Dissecting the Stanley partition function. J. Combin. Theory Ser. A 112(2), 277–291 (2005)
 7.
Berkovich, A., Grizzell, K.: Races among products, J. Combin. Theory Ser. A 119(8), 1789–1797 (2012)
 8.
Berkovich, A., Grizzell, K.: On the class of dominant and subordinate products. Mathematics 1(2), 65–75 (2013)
 9.
Berkovich, A., Grizzell, K.: A partition inequality involving products of two \(q\)Pochhammer symbols. In: Alladi, K., Garvan, F., Yee, A.J. (eds.) Ramanujan 125, pp. 25–39. Contemp. Math., 627, Amer. Math. Soc., Providence, RI (2014)
 10.
Berkovich, A., Uncu, A.K.: New weighted partition theorems with the emphasis on the smallest part of partitions. In: Andrews G.E., Garvan F. (eds.) Analytic Number Theory, Modular Forms and \(q\)Hypergeometric Series, pp. 69–94. Springer Proc. Math. Stat., 221, Springer, Cham (2017)
 11.
Breuer, F., Kronholm, B.: A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins. Res. Number Theory 2, Art. 2, 15 pp (2016)
 12.
Chapman, R.: Partitions with bounded differences between largest and smallest parts. Australas. J. Combin. 64, 376–378 (2016)
 13.
Gasper, G., Rahman, M.: Basic Hypergeometric Series. Second Edition. Encyclopedia of Mathematics and its Applications, Vol. 96. Cambridge University Press, Cambridge (2004)
 14.
Mc Laughlin, J.: Refinements of some partition inequalities. Integers 16, #PA66, 11 pp (2016)
Acknowledgements
Open access funding provided by Johannes Kepler University Linz. The authors would like to thank George Andrews for interest and helpful insights. We are grateful to William Severa and the anonymous referee for the careful reading of the manuscript. Research of the first author is partly supported by the Simons Foundation, Award ID: 308929. Research of the second author is supported by the Austrian Science Fund FWF, SFB5007 Project.
Author information
Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Berkovich, A., Uncu, A.K. Some Elementary Partition Inequalities and Their Implications. Ann. Comb. 23, 263–284 (2019). https://doi.org/10.1007/s0002601900433y
Received:
Accepted:
Published:
Issue Date:
Keywords
 Partition inequalities
 Partitions with bounded differences between largest and smallest parts
 Nonnegative qseries expansions
 Injective maps
 qBinomial theorem
 Heine transformations
 Jackson transformation
Mathematics Subject Classification
 05A15
 05A17
 05A19
 05A20
 11B65
 11P81
 11P84
 33D15