Indexed metadata

Elementary proofs of congruences modulo 5 for overpartitions with restricted odd differences

Bishnu Paudel, James A. Sellers, Haiyang Wang

Source record

Source: arXiv

Published: Sep 14, 2026

arXiv: 2609.16376

Open original source ↗

Source abstract

In 2015, Bringmann, Dousse, Lovejoy, and Mahlburg defined the function t(n)\overline{t}(n) to be the number of overpartitions of weight nn where (i) the difference between two successive parts may be odd only if the larger part is overlined and (ii) if the smallest part is odd then it is overlined. In their work, they proved that t(n)\overline{t}(n) satisfies an elegant congruence modulo 3. Since then, a number of authors have studied arithmetic properties satisfied by t(n)\overline{t}(n). In particular, in 2023, Hanson and Smith utilized the theory of modular forms to prove the following two congruences modulo 5: For all n0n\geq 0, t(80n+40)t(80n+60)0(mod5).\begin{align*} \overline{t}(80n+40)\equiv \overline{t}(80n+60)\equiv 0 \pmod{5}. \end{align*} Our goal in this work is to provide a truly elementary proof of this pair of congruences.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Elementary proofs of congruences modulo 5 for overpartitions with restricted odd differences — Mathematical Frontier Network