Congruences for Partition Pairs with Conditions
Number Theory
2015-04-10 v2
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.
Keywords
Cite
@article{arxiv.1408.5061,
title = {Congruences for Partition Pairs with Conditions},
author = {Chris Jennings-Shaffer},
journal= {arXiv preprint arXiv:1408.5061},
year = {2015}
}