Congruences for Partition Pairs with Conditions

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…