Refinements of Some Partition Inequalities

Abstract

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if M≥ 5 is an integer and the integers a and b are relatively prime to M and satisfy 1≤ a<b<M/2, and the c(m,n) are defined by \[ 1(sqa,sqM-a;qM)∞-1(sqb,sqM-b;qM)∞:=Σm,n≥ 0 c(m,n)sm qn, \] then c(m, Mn)≥ 0 for all integers m≥ 0, n≥ 0. %If, in addition, M is even, then c(m, Mn+M/2)≥ 0 for all integers m≥ 0, n≥ 0. A similar result is proved for the integers d(m,n) defined by \[ (-sqa,-sqM-a;qM)∞-(-sqb,-sqM-b;qM)∞:=Σm,n≥ 0 d(m,n)sm qn. \] In each case there are obvious interpretations in terms of integer partitions. For example, if p1,5(m,n) (respectively p2,5(m,n)) denotes the number of partitions of n into exactly m parts 1 ( 5) (respectively 2 ( 5)), then for each integer n ≥ 1, \[ p1,5(m,5n)≥ p2,5(m,5n), \,\,\,1 ≤ m ≤ 5n. \]

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…