# Explaining unforeseen congruence relationships between PEND and POND partitions via an Atkin–Lehner involution

## TL;DR

This paper explains a surprising connection between two types of integer partitions using a mathematical transformation called an Atkin–Lehner involution.

## Contribution

The paper introduces a novel relationship between PEND and POND partition congruences using an Atkin–Lehner involution.

## Key findings

- A relationship between PEND and POND partition congruences is established via an Atkin–Lehner involution.
- Once one family of congruences is known, the other follows directly from the established relationship.

## Abstract

For the past several years, numerous authors have studied POD and PED partitions from a variety of perspectives. These are integer partitions wherein the odd parts must be distinct (in the case of POD partitions) or the even parts must be distinct (in the case of PED partitions). More recently, Ballantine and Welch were led to consider POND and PEND partitions, which are integer partitions wherein the odd parts cannot be distinct (in the case of POND partitions) or the even parts cannot be distinct (in the case of PEND partitions). Soon after, the first author proved the following results via elementary q-series identities and generating function manipulations, along with mathematical induction: For all \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\alpha \ge 1$$\end{document}α≥1 and all \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$n\ge 0,$$\end{document}n≥0,\documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$$\begin{aligned} {{\,\textrm{pend}\,}}\left( 3^{2\alpha +1}n+\frac{17\cdot 3^{2\alpha }-1}{8}\right)&\equiv 0 \pmod {3}, \text { and} \\ {{\,\textrm{pond}\,}}\left( 3^{2\alpha +1}n+\frac{23\cdot 3^{2\alpha }+1}{8}\right)&\equiv 0 \pmod {3} \end{aligned}$$\end{document}pend32α+1n+17·32α-18≡0(mod3),andpond32α+1n+23·32α+18≡0(mod3)where \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${{\,\textrm{pend}\,}}(n)$$\end{document}pend(n) counts the number of PEND partitions of weight n and \documentclass[12pt]{minimal}
\usepackage{amsmath}
\usepackage{wasysym}
\usepackage{amsfonts}
\usepackage{amssymb}
\usepackage{amsbsy}
\usepackage{mathrsfs}
\usepackage{upgreek}
\setlength{\oddsidemargin}{-69pt}
\begin{document}$${{\,\textrm{pond}\,}}(n)$$\end{document}pond(n) counts the number of POND partitions of weight n. In this work, we revisit these families of congruences, and we show a relationship between them via an Atkin–Lehner involution. From this relationship, we can show that, once one of the above families of congruences is known, the other follows immediately.