Elementary Proofs of Recent Congruences for Overpartitions Wherein Non-Overlined Parts are Not Divisible by 6
Bishnu Paudel, James A. Sellers, Haiyang Wang

TL;DR
This paper provides elementary proofs for recent congruences related to overpartition functions where non-overlined parts are not divisible by 6, confirming conjectures and simplifying previous modular form-based proofs.
Contribution
It offers elementary, accessible proofs of complex overpartition congruences, including confirming a conjecture about divisibility by 128.
Findings
Confirmed the conjecture that R_6^*(n) is divisible by 128 for infinitely many n.
Provided elementary proofs for two previously modular form-based congruences.
Simplified the understanding of overpartition congruences using elementary methods.
Abstract
We define as the number of overpartitions of in which non-overlined parts are not divisible by . In a recent work, Nath, Saikia, and the second author established several families of congruences for , with particular focus on the cases and . In the concluding remarks of their paper, they conjectured that satisfies an infinite family of congruences modulo . In this paper, we confirm their conjectures using elementary methods. Additionally, we provide elementary proofs of two congruences for previously proven via the machinery of modular forms by Alanazi, Munagi, and Saikia.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
