Hostname: page-component-74656f9884-rngvg Total loading time: 0 Render date: 2026-11-06T01:28:40.989Z Has data issue: false hasContentIssue false

Some inequalities between $M(a,b,c;L;n)$ and the partition function $p(n)$

Published online by Cambridge University Press:  10 December 2024

Bing He*
Affiliation:
School of Mathematics and Statistics, HNP-LAMA, Central South University, Changsha 410083, Hunan, People’s Republic of China e-mail: yuhelingyun@foxmail.com
Linpei Li
Affiliation:
School of Mathematics and Statistics, HNP-LAMA, Central South University, Changsha 410083, Hunan, People’s Republic of China e-mail: 232111035@csu.edu.cn
Jian Cao
Affiliation:
School of Mathematics, Hangzhou Normal University, Hangzhou 311121, People’s Republic of China e-mail: 21caojian@hznu.edu.cn
Rights & Permissions [Opens in a new window]

Abstract

Let $p(n)$ and $M(m,L;n)$ be the number of partitions of n and the number of partitions of n with crank congruent to m modulo L, respectively, and let

$$ \begin{align*}M(a,b,c;L;n):= M(a,L;n) + M(b,L;n) + M(c,L;n).\end{align*} $$

In this paper, we focus on some relations between $M(m,L;n)$ and $p(n),$ which Dyson, Andrews, and Garvan etc. have studied previously. By applying a modification of the circle method to estimate the Fourier coefficients of generating functions, we establish the following inequalities between $M(a,b,c;L;n)$ and $p(n):$ for $n \geq 467$,

$$ \begin{align*} M(0,1,1;9;n)> \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 0,1,5,8 ~ (\mathrm{mod}~9), \\ M(0,1,1;9;n) < \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 2,3,4,6,7 ~ (\mathrm{mod}~9), \\ M(2,3,4;9;n) < \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 0,1,5,8 ~ (\mathrm{mod}~9), \\ M(2,3,4;9;n)> \frac{p(n)}{3} &\;\: \mathrm{when}\;\: n \equiv 2,3,4,6,7 ~ (\mathrm{mod}~9). \end{align*} $$

In the proof of these inequalities, an inequality for the logarithm of the generating function for $p(n)$ is derived and applied. Our method reduces the last possible counterexamples to $467 \leq n \leq 22471$, and it will produce more effective estimates when proving inequalities of such types.

Information

Type
Article
Copyright
© The Author(s), 2024. Published by Cambridge University Press on behalf of Canadian Mathematical Society