Congruences for Partition Pairs with Conditions

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.