The Rogers-Ramanujan-Gordon Theorem for Overpartitions

preprint2011arXivOpen access

Abstract

Let Bk,i(n)B_{k,i}(n) be the number of partitions of nn with certain difference condition and let Ak,i(n)A_{k,i}(n) be the number of partitions of nn with certain congruence condition. The Rogers-Ramanujan-Gordon theorem states that Bk,i(n)=Ak,i(n)B_{k,i}(n)=A_{k,i}(n). Lovejoy obtained an overpartition analogue of the Rogers-Ramanujan-Gordon theorem for the cases i=1i=1 and i=ki=k. We find an overpartition analogue of the Rogers-Ramanujan-Gordon theorem in the general case. Let Dk,i(n)D_{k,i}(n) be the number of overpartitions of nn satisfying certain difference condition and Ck,i(n)C_{k,i}(n) be the number of overpartitions of nn whose non-overlined parts satisfy certain congruences condition. We show that Ck,i(n)=Dk,i(n)C_{k,i}(n)=D_{k,i}(n). By using a function introduced by Andrews, we obtain a recurrence relation which implies that the generating function of Dk,i(n)D_{k,i}(n) equals the generating function of Ck,i(n)C_{k,i}(n). We also find a generating function formula of Dk,i(n)D_{k,i}(n) by using Gordon marking representations of overpartitions, which can be considered as an overpartition analogue of an identity of Andrews for ordinary partitions.

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.