A conjecture of Radu and Sellers on congruences modulo powers of 2 for broken 3-diamond partitions
Dandan Chen, Rong Chen, Siyu Yin

TL;DR
This paper proves a conjecture by Radu and Sellers regarding congruences modulo powers of 2 for broken 3-diamond partitions using an unconventional U-sequence.
Contribution
It introduces a novel approach with an unconventional U-sequence to resolve a conjecture on broken 3-diamond partition congruences.
Findings
Confirmed the conjecture on congruences modulo powers of 2.
Provided a new method involving an unconventional U-sequence.
Enhanced understanding of parity and congruences in partition functions.
Abstract
In 2007, Andrews and Paule introduced the family of functions , which enumerate the number of broken -diamond partitions for a fixed positive integer . In 2013, Radu and Sellers completely characterized the parity of for certain values of and proposed a conjecture on congruences modulo powers of for broken -diamond partitions. In this paper, we employ an unconventional -sequence to resolve the revised conjecture put forward by Radu and Sellers.
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.
