Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Refinements of Some Partition Inequalities (1901.01993v1)

Published 6 Jan 2019 in math.NT

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

Summary

We haven't generated a summary for this paper yet.