Next Article in Journal
On the Distribution of the spt-Crank
Previous Article in Journal
Stability of Solutions to Evolution Problems

Article

# On the Class of Dominant and Subordinate Products

Department of Mathematics, University of Florida, Gainesville, FL 32611-8105, USA
*
Author to whom correspondence should be addressed.
Mathematics 2013, 1(2), 65-75; https://doi.org/10.3390/math1020065
Received: 25 March 2013 / Revised: 12 April 2013 / Accepted: 22 April 2013 / Published: 15 May 2013

## Abstract

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na¨ıve version of Andrews’ anti-telescoping technique quite well. These new theorems also put to rest any notion that including parts of size 1 is somehow necessary in order to have a valid irreducible partition inequality. In addition, we prove (as a lemma to one of the theorems) a rather nontrivial class of rational functions of three variables has entirely nonnegative power series coefficients.

## 1. Introduction

When examining two q-products $Π 1$ and $Π 2$ and their corresponding q-series, it sometimes happens that the coefficients in the q-series for $Π 1$ are never less than the coefficients in the q-series for $Π 2$. When that happens, we say that $Π 1$ is dominant (in this pair of products) and that $Π 2$ is subordinate, and we express this relationship with the more succinct notation $Π 1 ≽ Π 2$. (Note that ≽ yields a partial ordering on the set of q-products if we identify products that produce the same q-series; then, any given product may be dominant when paired with some products, subordinate when paired with others, neither when paired with still other products, and both dominant and subordinate only when paired with “itself”.) Immediately from this definition it follows that if $Π 1 ≽ Π 2$, then the q-series determined by $Π 1 - Π 2$ must have nonnegative coefficients, i.e., $Π 1 - Π 2 ≽ 0$. Thus, determining whether a given pair of products is a dominant/subordinate pair solves an equivalent positivity problem.
Using the standard notations [1]
$( a ; q ) L = 1 if L = 0 ∏ j = 0 L - 1 ( 1 - a q j ) if L > 0$
$( a 1 , a 2 , ⋯ , a n ; q ) L = ( a 1 ; q ) L ( a 2 ; q ) L ⋯ ( a n ; q ) L$
and
$( a ; q ) ∞ = lim L → ∞ ( a ; q ) L$
we may say that, for example, in the Rogers–Ramanujan difference
$1 ( q , q 4 ; q 5 ) ∞ - 1 ( q 2 , q 3 ; q 5 ) ∞ ≽ 0$
the first product is dominant and the second product is subordinate. At the 1987 A.M.S. Institute on Theta Functions, Ehrenpreis asked if one can prove this dominance without resorting to the Rogers–Ramanujan identities. In 1999, Kadell [2] provided an affirmative answer to this question. In 2005, Berkovich and Garvan [3] proved a class of finite versions of such inequalities (from which the infinite versions are easily recovered), namely that
$1 ( q , q m - 1 ; q m ) L ≽ 1 ( q r , q m - r ; q m ) L$
if and only if $r ∤ ( m - r )$ and $( m - r ) ∤ r$. Note that this last inequality provides the finite version of Equation (4):
$1 ( q , q 4 ; q 5 ) L ≽ 1 ( q 2 , q 3 ; q 5 ) L$
In 2011, Andrews [4] proved the finite little Göllnitz inequality
$1 ( q , q 5 , q 6 ; q 8 ) L ≽ 1 ( q 2 , q 3 , q 7 ; q 8 ) L$
which (in 2012) Berkovich and Grizzell [5] generalized to
$1 ( q , q y + 2 , q 2 y ; q 2 y + 2 ) L ≽ 1 ( q 2 , q y , q 2 y + 1 ; q 2 y + 2 ) L$
where y is any odd integer greater than 1.
For Equations (4), (5), and (8), the proofs in each case relied solely on the construction of a suitable injection. For Equation (7), however, Andrews relied primarily on his anti-telescoping technique. A naïve version of Andrews’ anti-telescoping technique begins with two sequences of products, ${ P ( i ) } i = 1 ∞$ and ${ Q ( i ) } i = 1 ∞$, and the desire to show that, for every $L ≥ 1$,
$1 P ( L ) ≽ 1 Q ( L )$
One then simply writes (letting $P ( 0 ) = Q ( 0 ) = 1$)
$1 P ( L ) - 1 Q ( L ) = ∑ i = 1 L Q ( i - 1 ) P ( i ) Q ( L ) Q ( i ) Q ( i - 1 ) - P ( i ) P ( i - 1 )$
$= ∑ i = 1 L Q ( i ) Q ( i - 1 ) - P ( i ) P ( i - 1 ) P ( i ) · Q ( L ) Q ( i - 1 )$
and if one is lucky enough that each addend in Equation (10) is $≽ 0$, then that is all one needs to show in order to prove the desired inequality. This bit of serendipity is by no means trivial; for example, this naïve anti-telescoping fails to help show Equation (6) since, among numerous other terms, the coefficient of $q 8$ is $- 1$ in the second ($i = 2$) addend of the naïve anti-telescoping of Equation (6) for every $L > 1$. A less naïve approach might sometimes be more beneficial, but for our purposes in this paper the naïve approach outlined above is sufficient.
Now clearly we could multiply every exponent in any inequality akin to Equations (4)–(8) by some common factor to obtain an inequality without $( 1 - q )$ as the leading factor in the denominator on the left; when looking at the partition-theoretic interpretation, this creates “reducible” examples (but examples nonetheless) where parts of size 1 are not needed to “fill in the gaps”. In 2012, at the Ramanujan 125 Conference in Gainesville, Florida, Hamza Yesilyurt asked if the inclusion of the factor $( 1 - q )$ was necessary in all irreducible inequalities. We are pleased to answer in the negative, as stated in the following new theorem.
Theorem 1.1 For any sextuple of positive integers $( L , m , x , y , r , s )$,
$1 ( q x , q y , q r x + s y ; q m ) L ≽ 1 ( q r x , q s y , q x + y ; q m ) L$
Clearly Theorem 1.1 yields infinitely many irreducible examples. More astounding, however, is that the modulus m can be arbitrary. Even more amazing still is the relative ease with which the proof can be written using naïve anti-telescoping!
It is also possible, albeit more difficult, to use naïve anti-telescoping to yield the following new theorem.
Theorem 1.2 For any octuple of positive integers $( L , m , x , y , z , r , s , u )$,
$1 ( q x , q y , q z , q r x + s y + u z ; q m ) L ≽ 1 ( q r x , q s y , q u z , q x + y + z ; q m ) L$
The extra difficulty in proving Theorem 1.2 comes from the fact that it seems to be impossible to re-write the addends in a natural way that makes it obvious that each addend only contributes nonnegative coefficients to the q-series. Consequently, en route to proving Theorem 1.2, we will require the following unobvious result, which is worthwhile in its own right and is not found anywhere else. (Most notably, we do not find anything of this form in [6], which contains a compendium of rational functions with nonnegative coefficients.)
Lemma 1.3 Let r and s be positive integers. Then the multivariate rational function
$f ( x , y , t ) : = ( 1 - x y ) ( 1 - t x r ) ( 1 - t y s ) + ( 1 - t 2 ) ( x - x r ) ( y - y s ) ( 1 - t x r ) ( 1 - t y s ) ( 1 - x ) ( 1 - y ) ( 1 - t x ) ( 1 - t y )$
with $| x | < 1$, $| y | < 1$, and $| t | < 1$, has nonnegative coefficients when written as a power series centered at $( 0 , 0 , 0 )$.
In Section 2, we provide a proof of Theorem 1.1 using a simple rational function identity together with naïve anti-telescoping, followed by a discussion of a partition theoretic interpretation of the difference
$1 ( q x , q y , q r x + s y ; q m ) L - 1 ( q r x , q s y , q x + y ; q m ) L$
In Section 3 we give a proof of Lemma 1.3, which will be used in the proof of Theorem 1.2 in Sectionn 4. We then conclude in Section 5 with a brief discussion of a more general inequality.

## 2. Proof of Theorem 1.1

Let $P ( i ) : = ( q x , q y , q r x + s y ; q m ) i$ and $Q ( i ) : = ( q r x , q s y , q x + y ; q m ) i$. We observe that since the identity
$( 1 - t α ) ( 1 - t β ) ( 1 - t x y ) - ( 1 - t x ) ( 1 - t y ) ( 1 - t α β ) = t ( x - α ) ( 1 - β ) ( 1 - t y ) + t ( y - β ) ( 1 - t α ) ( 1 - x )$
is true, substituting $q x$, $q y$, $q r x$, and $q s y$ for x, y, α, and β, respectively, we can conclude that
$( 1 - t q r x ) ( 1 - t q s y ) ( 1 - t q x + y ) - ( 1 - t q x ) ( 1 - t q y ) ( 1 - t q r x + s y )$
and
$t q x ( 1 - q ( r - 1 ) x ) ( 1 - q s y ) ( 1 - t q y ) + t q y ( 1 - q ( s - 1 ) y ) ( 1 - t q r x ) ( 1 - q x )$
are identically equal. Letting $t = q ( i - 1 ) m$, we may use the equality of Equations (11) and (12) to write
$Q ( i - 1 ) P ( i ) Q ( L ) Q ( i ) Q ( i - 1 ) - P ( i ) P ( i - 1 ) = V ( i ) + W ( i )$
where
$V ( i ) : = q m ( i - 1 ) + y ( 1 - q ( s - 1 ) y ) ( 1 - q x ) ( 1 - q m ( i - 1 ) + r x ) P ( i ) · Q ( L ) / Q ( i - 1 )$
and
$W ( i ) : = q m ( i - 1 ) + x ( 1 - q ( r - 1 ) x ) ( 1 - q s y ) ( 1 - q m ( i - 1 ) + y ) P ( i ) · Q ( L ) / Q ( i - 1 )$
We note that since $( 1 - q x )$ and $( 1 - q y )$ are factors of the product $P ( i )$ and since $( 1 - q m ( i - 1 ) + r x )$ is a factor of the product $Q ( L ) / Q ( i - 1 )$, we have $V ( i ) ≽ 0$ for $1 ≤ i ≤ L$. To see that $W ( i ) ≽ 0$, we consider the following two cases.
• Suppose $i = 1$; then $( 1 - q x )$ and $( 1 - q y ) = ( 1 - q m ( i - 1 ) + y )$ are factors of $P ( i ) = P ( 1 )$ and $( 1 - q s y )$ is a factor of $Q ( L ) / Q ( i - 1 ) = Q ( L )$. Thus, $W ( 1 ) ≽ 0$.
• Suppose $i > 1$; then $( 1 - q x )$, $( 1 - q y )$, and $( 1 - q m ( i - 1 ) + y )$ are all independent factors of $P ( i )$. Thus, $W ( i ) ≽ 0$.
Finally, applying the anti-telescoping Equation (9), we have
$1 P ( L ) - 1 Q ( L ) = ∑ i = 1 L V ( i ) + W ( i )$
which then suffices to prove the theorem.
It would be nice to have a combinatorial proof of Equation (13), but such has not been discovered by the time this paper was written. We note, however, that a partition interpretation of the right-hand side of Equation (13) is possible. Given a partition π, we let $p j$ denote the part that is equal to $p + ( j - 1 ) m$, and we let $ν ( p j , π )$ represent the number of occurrences of the part $p j$ in the partition π. Then, for a fixed L we define
$M ( p , π ) : = max { j : ν ( p j , π ) > 0 } ∪ { 0 }$
and
$m ( p , π ) : = min { j : ν ( p j , π ) > 0 } ∪ { L + 1 }$
We may consider $∑ i = 1 L V ( i )$ and $∑ i = 1 L W ( i )$, from Equation (13), as two separate generating functions for partitions into parts congruent to (for $1 ≤ i ≤ L$) $x i$, $y i$, $( x + y ) i$, $( r x ) i$, $( r y ) i$, or $( r x + r y ) i$, subject to certain restrictions. (Note: in the cases where a particular part could arise in multiple ways, for example if $x 3 = y 1$ or $r x = y$, then it would be necessary to treat the parts that arise in different ways as distinct, perhaps by assigning them unique colors based on what the base part is; since the base part is always one of x, y, $( x + y )$, $r x$, $s y$, and $( r x + s y )$, no more than six colors should be required.) We may take the restrictions as follows.
 Restrictions for $∑ i = 1 L V ( i )$:V1: $M$(y, π) ≥ max({1, $M$(x, π)})V2: $M$(y, π) ≥ $M$(rx + sy, π)V3: m(rx, π) ≥ $M$(y, π)V4: m(sy, π) ≥ $M$(y, π)V5: m(x + y, π) ≥ $M$(y, π)V6: $ν$(x1, π) = oV7: $ν$(y1, π) < s ‒ 1 Restrictions for $∑ i = 1 L W ( i )$:W1: $M$(x, π) > $M$(y, π)W2: $M$(x, π) ≥ $M$(rx + sy, π)W3: m(rx, π) ≥ $M$(x, π)W4: m(sy, π) ≥ max({2, $M$(x, π)W5: m(x + y, π) ≥ $M$(x, π)W6: $ν$(x1, π) < r ‒ 1W7: $ν$(y1, π) < s
Since the restrictions V1 and W1 are mutually exclusive, we may consider the right-hand side of Equation (13) as the generating function for partitions into parts congruent to (for $1 ≤ i ≤ L$) $x i$, $y i$, $( x + y ) i$, $( r x ) i$, $( s y ) i$, or $( r x + s y ) i$ such that the partition satisfies either V1–V7 or W1–W7.

## 3. Proof of Lemma 1.3

Let $[ t n ] F ( t )$ denote the coefficient of $t n$ extracted from $F ( t )$ (when written as a Maclaurin series). Direct calculations yield
$[ t n ] f ( x , y , t ) = + ( 1 - x y ) ( x n + 1 - y n + 1 ) ( 1 - x ) ( 1 - y ) ( x - y ) + ( - x n + r ( 1 - x 2 ) + x n r + 1 ( 1 - x 2 r ) ) ( y - y s ) ( 1 - x ) ( 1 - y ) ( x - y ) ( x r - y s ) + ( - y n + s ( 1 - y 2 ) + y n s + 1 ( 1 - y 2 s ) ) ( x - x r ) ( 1 - x ) ( 1 - y ) ( x - y ) ( x r - y s ) + ( x ( n - 1 ) r ( 1 - x 2 r ) - y n - 1 ( 1 - y 2 ) ) y x r ( x - x r ) ( y - y s ) ( 1 - x ) ( 1 - y ) ( x - y ) ( x r - y s ) ( x r - y ) + ( y ( n - 1 ) s ( 1 - y 2 s ) - x n - 1 ( 1 - x 2 ) ) x y s ( x - x r ) ( y - y s ) ( 1 - x ) ( 1 - y ) ( x - y ) ( x r - y s ) ( y s - x )$
Claim:
$[ t n ] f ( x , y , t ) = + x n ( 1 - y n + 1 ) ( 1 - y ) ( 1 - x ) + ( y n + 1 - y ( n + 1 ) s ) ( x n - x r ) ( 1 - y ) ( 1 - x ) + ( y n - y n s ) ( x 2 - x 2 r ) ( 1 - y ) ( 1 - x ) + x ( y n - y ( n + 1 ) s ) 1 - y + ∑ j = 1 n - 1 x ( n - j ) r ( y j - y j s ) ( 1 - x 2 r ) ( 1 - y ) ( 1 - x ) + ∑ j = 0 ( n - 2 - δ ( n ) ) / 2 x n - 2 j - 1 y s ( 2 j + 1 ) ( 1 + x ) 1 - y + ∑ j = 1 ( n - 2 + δ ( n ) ) / 2 x n - 2 j y 2 j s ( 1 - y s ( n + 1 - 2 j ) ) ( 1 + x ) 1 - y + y n 1 - y + δ ( n ) x y ( n + 1 ) s 1 - y$
where $δ ( n ) = 0$ if n is even and $δ ( n ) = 1$ if n is odd. To verify Equation (15), one first eliminates the sums in Equation (15) to obtain
$[ t n ] f ( x , y , t ) = + x n ( 1 - y n + 1 ) ( 1 - y ) ( 1 - x ) + ( y n + 1 - y ( n + 1 ) s ) ( x n - x r ) ( 1 - y ) ( 1 - x ) + ( y n - y n s ) ( x 2 - x 2 r ) ( 1 - y ) ( 1 - x ) + x ( y n - y ( n + 1 ) s ) 1 - y + y n 1 - y + ( 1 + x ) x y s ( x n - 1 - y ( n - 1 ) s ) ( 1 - y ) ( x - y s ) + y x r ( x ( n - 1 ) r - y n - 1 ) ( 1 - x 2 r ) ( 1 - y ) ( 1 - x ) ( x r - y ) - y s ( n + 1 ) ( 1 + x ) ( x 2 - x n ) ( 1 - y ) ( 1 - x 2 ) - y s x r ( x ( n - 1 ) r - y s ( n - 1 ) ) ( 1 - x 2 r ) ( 1 - y ) ( 1 - x ) ( x r - y s )$
Then, one can either verify by hand or use any number of symbolic manipulation programs to verify that the right-hand sides of Equations (16) and (14) are equal by simplifying their difference and getting 0. (The authors used Maple.)
We now observe that Equation (15) implies that $[ t n ] f ( x , y , t )$ has nonnegative coefficients, provided $r ≥ n$. Moreover, the only possible negative coefficients are
$[ x j y k t n ] f ( x , y , t ) with 1 < r < n and r ≤ j < n < k < ( n + 1 ) s$
since all terms of Equation (15) yield manifestly nonnegative coefficients except for the second term when $r < n$, where we have
$( y n + 1 - y ( n + 1 ) s ) ( x n - x r ) ( 1 - y ) ( 1 - x ) = - ( y n + 1 + ⋯ + y ( n + 1 ) s - 1 ) ( x r + ⋯ + x n - 1 )$
Now suppose that the coefficient of $x j y k t n$ in the power series for $f ( x , y , t )$, centered at $( 0 , 0 , 0 )$, were negative; i.e., $[ x j y k t n ] f ( x , y , t ) < 0$. Then, we must have both $1 < r < n$ and $r ≤ j < n < k < s ( n + 1 )$. Further, by the symmetry of $f ( x , y , t )$ (with respect to the simultaneous swapping of x and r with y and s, respectively) we would know that $[ x k y j t n ] f ( x , y , t ) < 0$ as well, and hence $1 < s < n$ and $s ≤ k < n < j < r ( n + 1 )$. However, we then have a contradiction since we would have both $j < k$ and $k < j$. Thus, $[ x j y k t n ] f ( x , y , t ) ≥ 0$, and the lemma is proved.

## 4. Proof of Theorem 1.2

Let $P ( i ) : = ( q x , q y , q z , q r x + s y + u z ; q m ) i$ and $Q ( i ) : = ( q r x , q s y , q u z , q x + y + z ; q m ) i$. Our goal will be to show that each addend in the sum on the right-hand side of Equation (10) has nonnegative coefficients. We will do this by considering two cases based on the index of summation i in Equation (10): $i = 1$ and $2 ≤ i ≤ L$. First, though, we observe that
$( 1 - t α ) ( 1 - t β ) ( 1 - t γ ) ( 1 - t x y z ) - ( 1 - t x ) ( 1 - t y ) ( 1 - t z ) ( 1 - t α β γ )$
is identically equal to
$+ 1 2 t ( x - α ) ( 1 - t β ) ( 1 - t γ ) ( 1 - y z ) + ( 1 - t y ) ( 1 - t z ) ( 1 - β γ ) + 1 2 t ( y - β ) ( 1 - t γ ) ( 1 - t α ) ( 1 - z x ) + ( 1 - t z ) ( 1 - t x ) ( 1 - γ α ) + 1 2 t ( z - γ ) ( 1 - t x ) ( 1 - t y ) ( 1 - α β ) + 1 2 t ( z - γ ) ( 1 - t α ) ( 1 - t β ) ( 1 - x y ) + ( 1 - t 2 ) ( x - α ) ( y - β )$
Substituting $q x$, $q y$, $q z$, $q r x$, $q s y$, and $q u z$ for x, y, z, α, β, and γ, respectively, we may then conclude that
$- ( 1 - t q r x ) ( 1 - t q s y ) ( 1 - t q u z ) ( 1 - t q x + y + z ) - ( 1 - t q x ) ( 1 - t q y ) ( 1 - t q z ) ( 1 - t q r x + s y + u z )$
is identically equal to
$+ 1 2 t q x ( 1 - q ( r - 1 ) x ) ( 1 - t q s y ) ( 1 - t q u z ) ( 1 - q y + z ) + ( 1 - t q y ) ( 1 - t q z ) ( 1 - q s y + u z ) + 1 2 t q y ( 1 - q ( s - 1 ) y ) ( 1 - t q u z ) ( 1 - t q r x ) ( 1 - q z + x ) + ( 1 - t q z ) ( 1 - t q x ) ( 1 - q u z + r x ) + 1 2 t q z ( 1 - q ( u - 1 ) z ) ( 1 - t q x ) ( 1 - t q y ) ( 1 - q r x + s y ) + 1 2 t q z ( 1 - q ( u - 1 ) z ) ( 1 - t q r x ) ( 1 - t q s y ) ( 1 - q x + y ) + ( 1 - t 2 ) ( q x - q r x ) ( q y - q s y )$
Let $t : = q ( i - 1 ) m$. Then, the numerator of the ith addend in Equation (10), namely
$Q ( i ) Q ( i - 1 ) - P ( i ) P ( i - 1 )$
is given precisely by Equation (20). Now turning to the denominator of Equation (10), we may write
$Q ( L ) Q ( i - 1 ) = ( q r x , q s y , q u z , q x + y + z ; q m ) L ( q r x , q s y , q u z , q x + y + z ; q m ) i - 1 = ( t q r x , t q s y , t q u z , t q x + y + z ; q m ) L - i + 1$
and so we have that
$( 1 - t q r x ) ( 1 - t q s y ) ( 1 - t q u z ) divides Q ( L ) Q ( i - 1 ) whenever 1 ≤ i ≤ L$
Similarly, from the definition of $P ( i )$ we may deduce that
$( 1 - q x ) ( 1 - q y ) ( 1 - q z ) divides P ( 1 )$
and whenever $i > 1$ that
$( 1 - q x ) ( 1 - q y ) ( 1 - q z ) ( 1 - t q x ) ( 1 - t q y ) ( 1 - t q z ) divides P ( i )$
When $i = 1$ we have $t = 1$, and hence the numerator of the first addend in Equation (10) simplifies to
$Q ( 1 ) - P ( 1 ) = + 1 2 q x ( 1 - q ( r - 1 ) x ) ( 1 - q s y ) ( 1 - q u z ) ( 1 - q y + z ) + ( 1 - q y ) ( 1 - q z ) ( 1 - q s y + u z ) + 1 2 q y ( 1 - q ( s - 1 ) y ) ( 1 - q u z ) ( 1 - q r x ) ( 1 - q z + x ) + ( 1 - q z ) ( 1 - q x ) ( 1 - q u z + r x ) + 1 2 q z ( 1 - q ( u - 1 ) z ) ( 1 - q x ) ( 1 - q y ) ( 1 - q r x + s y ) + ( 1 - q r x ) ( 1 - q s y ) ( 1 - q x + y )$
Meanwhile, the denominator of the first addend in Equation (10) contains all of the factors indicated in Equation (21): $( 1 - q r x )$, $( 1 - q s y )$, $( 1 - q u z )$. The denominator also contains all of the factors indicated by Equation (22): $( 1 - q x )$, $( 1 - q y )$, $( 1 - q z )$. These factors, together with the “trick” of re-writing, for example,
$( 1 - q x + y ) = ( 1 - q x ) + q x ( 1 - q y )$
is enough to see that the first addend in Equation (10) only has nonnegative coefficients.
When $2 ≤ i ≤ L$, we have $t = q ( i - 1 ) m ≠ 1$, and hence the numerator of the ith addend in Equation (10) is precisely Equation (20). From Equations (21) and (23) we have the following factors in the denominator: $( 1 - t q r x )$, $( 1 - t q s y )$, $( 1 - t q u z )$, $( 1 - q x )$, $( 1 - q y )$, $( 1 - q z )$, $( 1 - t q x )$, $( 1 - t q y )$, $( 1 - t q z )$. Again employing the “trick” Equation (25) as necessary, we can handle most of the ith addend similar to before, except for the last term of Equation (20), which contains the factor
$( 1 - q x + y ) ( 1 - t q r x ) ( 1 - t q s y ) + ( 1 - t 2 ) ( q x - q r x ) ( q y - q s y )$
This factor is potentially problematic due to the presence of the factor $( 1 - t 2 )$ in the second term.
If we let f be given as in Lemma 1.3, then Equation (26) becomes
$f ( q x , q y , t ) ( 1 - t q r x ) ( 1 - t q s y ) ( 1 - q x ) ( 1 - q y ) ( 1 - t q x ) ( 1 - t q y )$
The last term of Equation (20), when divided by the nine factors listed above, then becomes
$1 2 t q z ( 1 - q ( u - 1 ) z ) f ( q x , q y , t ) ( 1 - t q u z ) ( 1 - q z ) ( 1 - t q z )$
which, in light of Lemma 1.3, clearly now has no negative coefficients. Thus, having shown that all addends in Equation (10) admit only nonnegative coefficients, Theorem 1.2 is proved.

## 5. Concluding Remarks

It seems to always be possible to find a suitable “splitting” to handle the $L = 1$ case, no matter how many variables are used. For example, if we increase from three to four main variables ($x 1$, ..., $x 4$, with corresponding $r 1$, ..., $r 4$), for $L = 1$ we have
$- 1 ( 1 - q x 1 ) ( 1 - q x 2 ) ( 1 - q x 3 ) ( 1 - q x 4 ) ( 1 - q r 1 x 1 + r 2 x 2 + r 3 x 3 + r 4 x 4 ) ) - 1 ( 1 - q r 1 x 1 ) ( 1 - q r 2 x 2 ) ( 1 - q r 3 x 3 ) ( 1 - q r 4 x 4 ) ( 1 - q x 1 + x 2 + x 3 + x 4 ) = h ( x 1 , x 2 , x 3 , r 1 , r 2 , r 3 ) + h ( x 1 , x 2 , x 4 , r 1 , r 2 , r 4 ) + h ( x 1 , x 3 , x 4 , r 1 , r 3 , r 4 ) + h ( x 2 , x 3 , x 4 , r 2 , r 3 , r 4 ) ( 1 - q x 1 + x 2 + x 3 + x 4 ) ( 1 - q r 1 x 1 + r 2 x 2 + r 3 x 3 + r 4 x 4 )$
where $h ( x 1 , x 2 , x 3 , r 1 , r 2 , r 3 ) : =$
$+ q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) + 1 2 · q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) + 1 2 · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) + 1 2 · q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) + 1 2 · q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) 1 - q x 1 · q r 2 x 2 ( 1 - q r 1 x 1 ) ( 1 - q r 2 x 2 ) + 1 2 · q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) 1 - q x 1 · q r 3 x 3 ( 1 - q r 1 x 1 ) ( 1 - q r 3 x 3 ) + 1 2 · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q r 3 x 3 1 - q r 3 x 3 + 1 2 · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q r 1 x 1 1 - q r 1 x 1 + 1 2 · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) · q r 2 x 2 1 - q r 2 x 2 + 1 2 · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) · q r 1 x 1 1 - q r 1 x 1 + 1 3 · q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) + 1 3 · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) + 1 3 · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) + q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q r 3 x 3 1 - q r 3 x 3 + q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) · q r 2 x 2 1 - q r 2 x 2 + q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) · q r 1 x 1 1 - q r 1 x 1 + q x 1 ( 1 - q ( r 1 - 1 ) x 1 ) ( 1 - q x 1 ) ( 1 - q r 1 x 1 ) · q r 2 x 2 1 - q r 2 x 2 · q r 3 x 3 1 - q r 3 x 3 + q x 2 ( 1 - q ( r 2 - 1 ) x 2 ) ( 1 - q x 2 ) ( 1 - q r 2 x 2 ) · q r 1 x 1 1 - q r 1 x 1 · q r 3 x 3 1 - q r 3 x 3 + q x 3 ( 1 - q ( r 3 - 1 ) x 3 ) ( 1 - q x 3 ) ( 1 - q r 3 x 3 ) · q r 2 x 2 1 - q r 2 x 2 · q r 1 x 1 1 - q r 1 x 1$
satisfies $h ( x 1 , x 2 , x 3 , r 1 , r 2 , r 3 ) ≽ 0$. Finding a suitable “splitting” with $t : = q ( i - 1 ) m$ inserted into opportune locations, as we did in the proofs of the Theorems 1.1 and 1.2, is a much more difficult task here. (We think of this as inserting the t’s since we wish to recover the $L = 1$ case when we let $t = 1$.) The authors of this manuscript do not currently possess such a “splitting” for this case. Nonetheless, the authors are fairly confident in the veracity of the following proposal.
Proposal 5.1 For any $( 2 n + 2 )$-tuple $L , m , x 1 , ⋯ , x n , r 1 , ⋯ , r n$ of positive integers,
$1 ( q x 1 , ⋯ , q x n , q Σ ; q m ) L ≽ 1 ( q r 1 x 1 , ⋯ , q r n x n , q σ ; q m ) L$
where $Σ : = r 1 x 1 + ⋯ + r n x n$ and $σ : = x 1 + ⋯ + x n$.
We note that Proposal 5.1 is true for $L = 1$ since the right-hand side of Equation (27) could be interpreted as the generating function for partitions into parts from the set $S : = { x 1 , ⋯ , x n , Σ }$ (parts with the same numeric value but distinct origins having different colors, thus ensuring $| S | = n + 1$) such that for any such partition π, there is an integer A with the property that
$A ≡ ν ( x 1 , π ) ( mod r 1 ) A ≡ ν ( x 2 , π ) ( mod r 2 ) ⋮ A ≡ ν ( x n , π ) ( mod r n )$
where $ν ( p , π )$ is the number of occurrences of the part p in the partition π. This set of partitions is a subset of the set of all partitions into parts from the set S, which is what the left-hand side of Equation (27) would count. To see this clearly, we let $π ′$ be a partition with parts from the set $S ′ : = { r 1 x 1 , ⋯ , r n x n , σ }$ and let $μ ′ : = min ( { ν ( r i x i , π ′ ) : 1 ≤ i ≤ n } )$. Then we can explicitly define an injection (for $L = 1$) mapping $π ′ ↦ π$ as follows:
$ν ( Σ , π ) : = μ ′ ν ( x i , π ) : = r i · ( ν ( r i x i , π ′ ) - μ ′ ) + ν ( σ , π ′ )$
Clearly we can then choose $A = ν ( σ , π ′ )$. Now this mapping is invertible since if we let $μ : = min ( { ν ( x i , π ) : 1 ≤ i ≤ n } )$ we have
$ν ( σ , π ′ ) = μ ν ( r i x i , π ′ ) = ν ( x i , π ) - μ r i + ν ( Σ , π )$
Thus, the proposal is proved for $L = 1$.
Finally, we intend to explore possible connections with the recent work “A q-rious positivity” by S. Ole Warnaar and Wadim Zudilin (see [7]). In particular, we are quite q-rious as to how the validity of inequalities, like those in this paper, for $L = 1$ might imply the validity for all positive L, a sentiment that seems echoed by the authors of [7].

## Acknowledgements

We would like to thank George Andrews and Wadim Zudilin for their interest and helpful discussions.

## References

1. Andrews, G.E. The Theory of Partitions; Cambridge Mathematical Library, Cambridge University Press: Cambridge, UK, 1998; Reprint of the 1976 original. [Google Scholar]
2. Kadell, K.W.J. An injection for the Ehrenpreis Rogers-Ramanujan problem. J. Combin. Theory Ser. A 1999, 86, 390–394. [Google Scholar] [CrossRef]
3. Berkovich, A.; Garvan, F.G. Dissecting the Stanley partition function. J. Combin. Theory Ser. A 2005, 112, 277–291. [Google Scholar] [CrossRef]
4. Andrews, G.E. Differences of partition functions: The anti-telescoping method. Dev. Math. 2013, 28, 1–20. [Google Scholar]
5. Berkovich, A.; Grizzell, K. Races among products. J. Combin. Theory Ser. A 2012, 119, 1789–1797. [Google Scholar] [CrossRef]
6. Gessel, I.M. Integer quotients of factorials and algebraic generating functions, MIT Combinatorics Seminar, 30 September 2011, as transmitted via the world-wide web. Available online: http://people.brandeis.edu/ gessel/homepage/slides/int-quot.pdf (accessed on 14 May 2013).
7. Warnaar, S.O.; Zudilin, W. A q-rious positivity. Aequationes Math. 2011, 81, 177–183. [Google Scholar] [CrossRef]