Congruences for Partition Pairs with Conditions
classification
🧮 math.NT
keywords
partitioncongruencespairspartbaileychancombinatorialconditions
read the original abstract
We prove congruences for the number of partition pairs $(\pi_1,\pi_2)$ such that $\pi_1$ is non-empty, $s(\pi_1)\le s(\pi_2)$, and $\ell(\pi_2)< 2s(\pi_1)$ where $s(\pi)$ is the smallest part and $\ell(\pi)$ is the largest part of a partition. The proofs use Bailey's Lemma and a generalized Lambert series identity of Chan. We also discuss how a partition pair crank gives combinatorial refinements of these congruences.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.