An Overpartition Analogue of Bressoud's Theorem of Rogers-Ramanujan Type

preprint2012arXivOpen access

Abstract

For k≥i≥1k\geq i\geq 1, let Bk,i(n)B_{k,i}(n) denote the number of partitions of nn such that part 1 appears at most i−1i-1 times, two consecutive integers l and l+1l+1 appear at most k−1k-1 times and if l and l+1l+1 appear exactly k−1k-1 times then the total sum of the parts l and l+1l+1 is congruent to i−1i-1 modulo 2. Let Ak,i(n)A_{k,i}(n) denote the number of partitions with parts not congruent to ii, 2k−i2k-i and 2k2k modulo 2k2k. Bressoud's theorem states that Ak,i(n)=Bk,i(n)A_{k,i}(n)=B_{k,i}(n). Corteel, Lovejoy, and Mallet found an overpartition analogue of Bressoud's theorem for i=1i=1, that is, for partitions not containing nonoverlined part 1. We obtain an overpartition analogue of Bressoud's theorem in the general case. For k≥i≥1k\geq i\geq 1, let Dk,i(n)D_{k,i}(n) denote the number of overpartitions of nn such that the nonoverlined part 1 appears at most i−1i-1 times, for any integer ll, ll and nonoverlined l+1l+1 appear at most k−1k-1 times and if the parts ll and the nonoverlined part l+1l+1 appear exactly k−1k-1 times then the total sum of the parts ll and nonoverlined part l+1l+1 is congruent to the number of overlined parts that are less than l+1l+1 plus i−1i-1 modulo 2. Let Ck,i(n)C_{k,i}(n) denote the number of overpartitions with the nonoverlined parts not congruent to ±i\pm i and 2k−12k-1 modulo 2k−12k-1. We show that Ck,i(n)=Dk,i(n)C_{k,i}(n)=D_{k,i}(n). This relation can also be considered as a Rogers-Ramanujan-Gordon type theorem for overpartitions.

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.