Arithmetic properties of cubic and overcubic partition pairs
Chiranjit Ray, Rupam Barman

TL;DR
This paper investigates arithmetic properties of cubic and overcubic partition pairs, proving specific divisibility congruences and demonstrating that these partition counts are divisible by high powers of 2 for most integers, using modular forms.
Contribution
It proves a conjecture on divisibility of cubic partition pairs and establishes new congruences for overcubic partition pairs using modular form techniques.
Findings
Proved that b(49n+37) is divisible by 49.
Established two congruences modulo 256 for overcubic partition pairs.
Showed that overcubic partition counts are divisible by 2^k for almost all n.
Abstract
Let denote the number of cubic partition pairs of . We give affirmative answer to a conjecture of Lin, namely, we prove that We also prove two congruences modulo satisfied by , the number of overcubic partition pairs of . Let denote the number of overcubic partition of . For a fixed positive integer , we further show that and are divisible by for almost all . We use arithmetic properties of modular forms to prove our results.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
