Some Elementary Partition Inequalities and Their Implications

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≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L\ge 1$$\end{document}, the number of partitions with l-s≤L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l-s \le L$$\end{document} and s=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s=1$$\end{document} is greater than the number of partitions with l-s≤L\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$l-s\le L$$\end{document} and s>1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s>1$$\end{document}. Here l and s are the largest part and the smallest part of the partition, respectively.


Introduction
Let π = (1 f1 , 2 f2 , . . . ) be a sequence, where all exponents f i ∈ Z ≥0 and all but finitely many of them are zero. We call π a partition (shown in frequency representation [2]), where the exponents f i are the number of occurrences of i. The numbers i with non-zero frequencies in π are called parts of π. Since there are only finitely many non-zero frequencies in a partition π, the sum |π| := i≥1 i · f i is finite. This sum, |π|, is called the norm of the partition π. 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 π = (1 4 , 3 2 , 4 0 , 10 1 ) is a partition of 20 (meaning |π| = 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 π. The partition where all the frequencies are equal to zero is a conventional and unique partition of 0.
Let δ i,j be the standard Kronecker delta function yielding 1 for i = j, and vanishing otherwise. We define sets A L,1 and A L,2 for integers L ≥ 1.
(i) Let A L,1 be the set of partitions with the smallest part being 1, where all the parts ≤ L + 1 and f L = δ L,1 , (ii) and let A L,2 be the set of non-empty partitions where the parts are in the domain {2, 3, . . . , L + 1}.
These sets satisfy the following relation. Elementary combinatorial inequalities, such as (1.1), have interesting implications for q-series and the theory of partitions. This simple observation about the magnitude of sets, in this case, implies non-negativity results for a refinement of an earlier discussed-weighted partition identity result [10]. We introduce that result and its refinement here.
Note that for any π ∈ U with an even frequency of 1 (where f 1 might be 0) we have t(π) = 0. We will refer to t(π) as the length of the initial odd-frequency chain. With this new statistic, the authors have proven a new combinatorial identity of partitions. Theorem 1.2. We have π∈U (−1) s(π)+1 q |π| = π∈U t(π)q |π| . (1.2) This generating function identity can be articulated easily as a combinatorial correspondence as follows: The total count of partitions of a positive integer N , 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 odd-frequency chain lengths of partitions of N .
One example of Theorem 1.2 is given in Table 1.
We define non-negativity of a series S = n≥0 a n q n , if for all n, a n ≥ 0, where q is a formal summation variable. We denote the non-negativity by the notation S 0.
One important observation about Theorem 1.2 is that the statistic t(π) is non-negative for any partition π. 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 non-negative. Written in analytic form, the identity (1.2) is equivalent to (1 − aq i ) and (a; q) ∞ := lim n→∞ (a; q) L for |q| < 1.
The left side of (1.3) is not manifestly non-negative 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(π) statistic) shows the non-negativity, 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 We remark that for L = 0, the right-hand 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 q-series summation formulas. Theorem 1.3 will be proven in Sect. 5. Section 6 has an excursion in different representations and an observably non-negative 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 q-Hypergeometric Identities
Some q-hypergeometric functions and some of their related formulas that will be used later are stated here. Let r and s be non-negative integers and a 1 , a 2 , . . . , a r , b 1 , b 2 , . . . , b s , q, and z be variables. Then Let a, b, c, q, and z be variables. The q-binomial 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 ≥ 2 and N ≥ 1, Note that the claimed inequality of Theorem 1.1 is not true for L = 1 as the set A 1,1 only has partitions of type (1 1 , 2 f2 ) and A 1,2 only has partitions of type (2 1+f2 ). Hence, A 1,1 has a single partition for every odd norm and 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 ≥ 2, we prove the inequality (1.1) in an injective manner.
The parity of the frequency of 1 in the image clearly determines the case. Hence, γ * is an injection demonstrating (1.1) for L = 2. For L ≥ 3, let π = 1 0 , 2 f2 , . . . , L fL , (L + 1) fL+1 be a partition from the set A L,2 . Define by the following cases: (i) if 2 < s(π) < L + 1, then The image of a partition π ∈ 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 pre-image by looking at the smallest part size that is greater than 1. This proves that γ is an injection and it is enough to show (1.1).
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 A L,i up by one and also get a similar result to Theorem 1.1. Let L ≥ 1 be an integer and define Before the proof of Theorem 3.1, we examine the excluded initial cases of L. In the case L = 1, B 1,1 is the set of partitions of type 2 1 , 3 f3 . Hence, all partitions of B 1,1 have norm 2 modulo 3. The set B 1,2 contains partitions only of the type 3 1+f3 , which 0 modulo 3 norm. Therefore, the inequality (3.1) cannot hold for all N . The sets B 2,1 and B 2,2 contain partitions exclusively of the type 2 1+f2 , 4 f4 and 3 f3 , 4 f4 with f 3 + f 4 > 0, respectively. It is easy to see that all the partitions in B 2,1 have even norms, but for any k ≥ 0, there are partitions of odd norm 4k + 3 in 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 π = 3 f3 , 4 f4 , 5 f5 be a partition in B 3,2 , with norm > 3. Let Γ * 1 be the map from B 3,2 to B 3,1 as follows: This case by case map Γ * 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 B L,1 does not have a partition with norm N = 3 whereas (3) is a partition of B L,2 for all L ≥ 3. This single discrepancy is corrected with the term δ N,3 in the inequality (3.1).
Let π = 3 f3 , . . . , (L + 2) fL+2 be a partition in B L,2 , with norm > 3. For L = 2m − 1 ≥ 5, we define the injective map Γ 1 as follows: The map Γ 1 for odd L ≥ 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 Γ * 1 for L = 3 as a derivation of Γ 1 . We use the Cases (i), (iii) and (v) of Γ 1 as they are and modify the Case (iv) as π → 2 3 , 3 f3−2 , 5 f5 . The Case (ii) of Γ 1 does not apply for L = 3. Now we define the map Γ * 2 for L = 4. Let π = 3 f3 , 4 f4 , 5 f5 , 6 f6 with |π| = 3. Then the map Γ * 2 sends π to the following images depending on the following cases: ( (1) and f 6 > 0, then π → 2 3 , or f 6 = 0 and f 4 > 0, then π → 2 2 , The partitions (4,5) and (3 3 ) in 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 Γ * 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 sub-case the image is coming from. This injective map can be generalized for larger even L. We define Γ 2 for all even L = 2m ≥ 6. Let π = 3 f3 , . . . , (L + 2) fL+2 be a partition in B L,2 , with norm > 3: The injection Γ 2 , just like Γ 1 , has no problem in separating the cases when f 2 = 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 ≥ 6 or equivalently m ≥ 3 is used implicitly as it is necessary for Case (vii) to be defined.
For the L = 4 case, our injection Γ * 2 for partitions |π| with norm not equal to 3 or 9 can be related with Γ 2 , where we use Cases (i)-(iv) and (vi) with m = 2, where Case (vi) comes with the extra assertion that f 3 − 2 = 1. Table 3. Example of Theorem 3.1 with L = 5 and N = 12, where the images of the map Γ 1 are also indicated π ∈ B 5,2 Γ 1 π ∈ B 5,1 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: 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 ∞, this conjecture is nothing but a tautology.
In the definition of B L,i , we shifted the permissible part sizes of A L,i up by one. Another route to take would be shifting the sets, but keeping the impermissible part L of A L,i the same. For L ≥ s + 1, let C * L,s,1 be the set of partitions where the smallest part is s, all the parts are ≤ L + s and L does not appear as a part. Similar to Conjecture 3.2, we also claim that In Sect. 7, we will be reiterating these conjectures and state their analytic versions.

Some Analytic Non-negativity Results
Theorems 1.1 and 3.1 lead to new non-negativity results and some new summation formulas. The analytic analogue of Theorem 1.1 is the following: 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 non-negative.
Proof of Theorem 4.1. All we need to point out is that q is the generating function for the number of partitions from the set A L,1 and that 1 (q 2 ; q) L − 1 is the generating function for the number of partitions from the set A L,2 . Theorem 1.1 proves the non-negativity assertion for H L,1 (q), where L ≥ 2.
We note that any expression of the following form is non-negative for any I ⊂ N. The first term can be thought as the generating function for the partitions with parts in the set 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 non-negative by this observation. The coefficients of H 1,1 (q) = q/(1 + q) are consistent with our earlier observations about the A 1,1 and 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 non-negative integer L, Now that we know the relation between the injections γ * , and γ 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 A L,1 that are not an image of these injections. For L = 2, it is clear that the partitions of type (i) 1 1 , 2 0 , 3 f3 , where f 3 is a non-negative integer, (ii) 1 2j+5 , 2 0 , 3 f3 for j and f 3 non-negative integers are the elements of A 2,1 , which are not in the range of γ * . The generating functions of such partitions can be easily written as Let L ≥ 3, given a partition π ∈ A L,1 \γ(A L,2 ), π can have one of the following three forms: (i) for 2 < s < L + 1, 1 tL+1 , (s − 1) k+2 , . . . , L 0 , (L + 1) fL+1 , where t and k are non-negative integers, (ii) 1 kL+1 , L 0 , (L + 1) fL+1 , where k ≥ 2 or 0, (iii) 1 kL+r , . . . , L 0 , (L+1) fL+1 , where r ∈ {3, . . . , L} and k is a non-negative 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 ≥ 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 γ map is not defined for these cases.

Theorem 4.2. For a positive integer L,
A direct proof can also be given.

Observe that
This is because the left-hand side sum is the generating function for the number of non-zero partitions π into distinct parts ≤ L with weights (−1) ν(π)−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.
Taking the limit L → ∞ in (4.6), it is easy to get: One can also give a direct q-hypergeometric proof of Corollary 4.3. This proof amounts to using the second Heine transformation (2.3) followed by the q-binomial theorem (2.1).
Similar to Theorems 1.1, 3.1 also has a q-theoretic equivalent.

Theorem 4.4. For L ≥ 3,
Proof. For L ≥ 3, the generating functions for the number of partitions coming from the sets B L,1 and 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 non-negativity.
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 γ after Theorem 4.1, one can look for the partitions that are outside of the image of Γ * 1 , Γ 1 , etc. and write the (4.8) expression with manifestly non-negative terms. Yet, the increase in On the right-hand side of (4.10), the kth term is the generating function for the number of partitions from the kth Γ 1 unmapped case described above, where k ∈ {1, 2, . . . , 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 non-negative terms for even choices of L with the same type of argument for Γ * 2 and Γ 2 injections.

An Alternative Proof of Theorems 1.2 and 1.3
We start this section by recalling Theorem 1.2: 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 ±1 weights depending on the parity of their ranks. Observe that π∈D (−1) r(π) q |π| = n≥0 (−1) n (q; q) n q n+1 = n≥1 q n(n+1)/2 (−q; q) n , (5.1) where 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 q-factorial (q; q) ∞ , the right-hand side series of (5.1) becomes the right-hand side of (1.3). Also recall that The middle-term of (5.1) after the division with (q; q) ∞ 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 non-negativity question: 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, π∈U , s=1, l−s≤L q |π| , 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 π∈U , s=1, l−s≤L For the second generating function of (5.3), we formulate the generating function as a sum over the number of parts. Let π be a partition into n parts where the smallest part ≥ 2. We can clearly understand that |π| ≥ 2n since there are n parts and all the parts are ≥ 2. The whole column over the smallest part of the partition π is generated by the q-factor q 2n 1 − q n .
Stripping the column of the smallest part from the far left of the Ferrers diagram of π, we are left with a new partition with ≤ n − 1 parts, where the largest part is ≤ L. These partitions are generated by the q-binomial 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 non-negativity.
Proof. We start by showing the functional relation between G L,1 (q) and H L,1 (q). Comparing the right-hand 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 q-binomial theorem (2.1), we can verify the formula of G L,1 (q):
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 right-hand side of (5.9) by focusing on the smallest parts π∈U , s>1, s≡1(mod 2), l−s≤L 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: Moreover, one can write the expression n≥1 q n 1 + q n L + (n − 1) (n − 1) q q-hypergeometrically. Note that 1 + q 1 + q n = (−q; q) n−1 (−q 2 ; q) n−1 .
Now it is easy to see that Applying the first Heine transformation (2.2) to this 2 φ 1 , we get the q-series of (1.4).
Applying the Jackson transformation (2.5) to (6.3) gives the identity After elementry simplifications and shifting the summation variable n → n−1, we arrive at the identity The right-hand 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.
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 1 (q; q) L n≥1 (−q 1−L ; q) n−1 (−q; q) n q L(n−1)+n , (6.6) 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 term-by-term with the left-hand side expression n≥1 q n 1 + q n L + (n − 1) (n − 1) q , evaluated at L = 0, and when L → ∞, it matches term-by-term the right-hand side 1 (q; q) L n≥1 q ( n+1 2 ) (−q; q) n (1 − q L+n ) , as L → ∞ 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 (π) for partitions, which would be the refined statistics of t(π) 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 non-negative statistic t(π). Another question is related to the H L,1 (q) and H L,2 (q) functions of Sect. 4. Recall that a series n≥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 q-products. Let Then we have the following claim: 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 one-time 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. source, provide a link to the Creative Commons license, and indicate if changes were made.
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.