Congruences for Partition Pairs with Conditions
arXiv:1408.5061
Abstract
We prove congruences for the number of partition pairs such that is non-empty, , and where is the smallest part and 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.