Answers are grounded in this paper and cite their sources.
This note is devoted to the study of inequalities related to the second shifted difference of the number of integer partitions p(n) and of overpartitions p(n) by an elementary combinatorial approach.Recently Gomez, Males, and Rolen proved the positivity of ∆ 2 j (p(n)) = p(n)-2p(n-j)+p(n-2j) by employing the Hardy-Ramanujan-Rademacher formula for p(n) and Lehmer's error bound.Our goal is to prove ∆ 2 j (p(n)) ≥ 0 (resp.∆ 2 j (p(n)) > 0) by an explicit description of a non-empty subset, say X 2 p (n, j) of the set of integer partitions P (n) (resp.
No takes yet. Share an insight, caveat, or question.
Koustav Banerjee (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: