English

Congruences for Partition Pairs with Conditions

Number Theory 2015-04-10 v2

Abstract

We prove congruences for the number of partition pairs (π1,π2)(\pi_1,\pi_2) such that π1\pi_1 is non-empty, s(π1)s(π2)s(\pi_1)\le s(\pi_2), and (π2)<2s(π1)\ell(\pi_2)< 2s(\pi_1) where s(π)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.

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}
}
R2 v1 2026-06-22T05:35:45.275Z