Congruences and recursions for the cubic partition
Shane Chern, Manosij Ghosh Dastidar

TL;DR
This paper introduces new congruences modulo 11 for the cubic partition function, offers an elementary proof of a known congruence, and establishes a recursion for the function, broadening understanding of its properties.
Contribution
It presents two new congruences for cubic partitions, an elementary proof of an existing congruence, and a recursion formula for the cubic partition function.
Findings
Two new congruences modulo 11 for p_2(n)
Elementary proof of Chan's congruence
A recursion for p_2(n)
Abstract
Let denote the number of cubic partitions. In this paper, we shall present two new congruences modulo for . We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will establish a recursion for , which is a special case of a broader class of recursions.
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.
