An infinite family of internal congruences modulo powers of 2 for partitions into odd parts with designated summands
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908380771123200 |
|---|---|
| author | Chern, Shane Sellers, James A. |
| author_facet | Chern, Shane Sellers, James A. |
| contents | 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 $n$ by the function $PDO(n)$. Since then, numerous authors have proven a variety of divisibility properties satisfied by $PDO(n)$. Recently, the second author proved the following internal congruences satisfied by $PDO(n)$: For all $n\geq 0$, \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 $k\geq 0$ and all $n\geq 0$, $$PDO(2^{2k+3}n) \equiv PDO(2^{2k+1}n) \pmod{2^{2k+3}}.$$ We utilize several classical tools to prove this family, including generating function dissections via the unitizing operator of degree two, various modular relations and recurrences involving a Hauptmodul on the classical modular curve $X_0(6)$, and an induction argument which provides the final step in proving the necessary divisibilities. It is notable that the construction of each $2$-dissection slice of our generating function bears an entirely different nature to those studied in the past literature. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_04348 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | An infinite family of internal congruences modulo powers of 2 for partitions into odd parts with designated summands Chern, Shane Sellers, James A. Number Theory 11P83, 05A17 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 $n$ by the function $PDO(n)$. Since then, numerous authors have proven a variety of divisibility properties satisfied by $PDO(n)$. Recently, the second author proved the following internal congruences satisfied by $PDO(n)$: For all $n\geq 0$, \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 $k\geq 0$ and all $n\geq 0$, $$PDO(2^{2k+3}n) \equiv PDO(2^{2k+1}n) \pmod{2^{2k+3}}.$$ We utilize several classical tools to prove this family, including generating function dissections via the unitizing operator of degree two, various modular relations and recurrences involving a Hauptmodul on the classical modular curve $X_0(6)$, and an induction argument which provides the final step in proving the necessary divisibilities. It is notable that the construction of each $2$-dissection slice of our generating function bears an entirely different nature to those studied in the past literature. |
| title | An infinite family of internal congruences modulo powers of 2 for partitions into odd parts with designated summands |
| topic | Number Theory 11P83, 05A17 |
| url | https://arxiv.org/abs/2308.04348 |