## Abstract

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called partitions with designated summands. These are built by taking unrestricted integer partitions and designating exactly one part of each size. In the 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 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 ≥ 0, PDO(4n) ≡ PDO(n) (mod 4), PDO(16n) ≡ PDO(4n) (mod 8). In the present work, we significantly extend these results by proving the following new infinite family of congruences: For all k ≥ 0 and all n ≥ 0, PDO(2^{2}k^{+3}n) ≡ PDO(2^{2}k^{+1}n) (mod 2^{2}k^{+3}). To do so, we utilize several classical tools, including generating function dissections via the unitizing operator of degree 2, various modular relations and recurrences involving a Hauptmodul on the classical modular curve X0(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.

Original language | English (US) |
---|---|

Pages (from-to) | 43-64 |

Number of pages | 22 |

Journal | Acta Arithmetica |

Volume | 215 |

DOIs | |

State | Published - 2024 |

### Bibliographical note

Publisher Copyright:© Instytut Matematyczny PAN, 2024.

## Keywords

- congruences
- designated summands
- dissections
- generating functions
- modular forms
- partitions