An infinite family of internal congruences modulo powers of 2 for partitions into odd parts with designated summands
Shane Chern, James A. Sellers

TL;DR
This paper proves an infinite family of divisibility congruences for the number of partitions into odd parts with designated summands, extending previous results and employing modular forms, generating functions, and induction techniques.
Contribution
It introduces a new infinite family of internal congruences for PDO(n) modulo powers of 2, expanding the understanding of divisibility properties of these specialized partitions.
Findings
Established a family of congruences for PDO(2^{2k+3}n) modulo 2^{2k+3}.
Used modular relations and generating function dissections to prove the results.
Demonstrated novel dissection techniques differing from past literature.
Abstract
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called \emph{partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence of a part. In that same work, Andrews, Lewis, and Lovejoy also studied such partitions wherein all parts must be odd, and they denoted the number of such partitions of size by the function . Since then, numerous authors have proven a variety of divisibility properties satisfied by . Recently, the second author proved the following internal congruences satisfied by : For all , \begin{align*} PDO(4n) &\equiv PDO(n) \pmod{4},\\ PDO(16n) &\equiv PDO(4n) \pmod{8}. \end{align*} In this work, we significantly extend these internal congruence results by proving the following new infinite family of congruences: For all…
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.
Taxonomy
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Advanced Combinatorial Mathematics
