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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call