2017/02/28 by He, Thomas Y., Wang, Allison Y. F., Zhao, Alice X. H.
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1702.08621
We give an overpartition analogue of Bressoud's combinatorial generalization of the Göllnitz-Gordon theorem for even moduli in general case. Let \widetildeOk,i(n) be the number of overpartitions of n whose parts satisfy certain difference condition and \widetildePk,i(n) be the number of overpartitions of n whose non-overlined parts satisfy certain congruence condition. We show that \widetildeOk,i(n)=\widetildePk,i(n) for 1≤ i