An overpartition analogue of Bressoud's theorem of Rogers-Ramanujan-Gordon type (Q2254860)

In [J. Comb. Theory, Ser. A 27, 64--68 (1979; Zbl 0416.10009)] \textit{D. M. Bressoud} gave an even modulus analog of the classical \textit{B. Gordon}'s theorem [Am. J. Math. 83, 393--399 (1961; Zbl 0100.27303)], and in [J. Number Theory 128, No. 6, 1602--1621 (2008; Zbl 1144.11072)] \textit{S. Corteel} et al. presented an overpartition analog of Bressoud's result for overpartitions not containing non-overlined part 1. In this paper the authors give the following overpartition analogue of Bressoud's theorem in the general case: Given positive integers \(k\geq 2\) and \(i\) such that \(k\geq i\geq 1\), let \(D_{k,i}(n)\) denote the number of overpartitions of \(n\) such that {\parindent= 5mm \begin{itemize}\item[1.] the non-overlined part 1 appears at most \(i-1\) times; \item[2.] for any integer \(l\), the parts \(l\) and non-overlined \(l+1\) appear at most \(k-1\) times, and \item[3.] if the parts \(l\) and non-overlined \(l+1\) together appear exactly \(k-1\) times, then the sum of the parts \(l\) and non-overlined \(l+1\) has the same parity as the number of overlined parts that are less than or equal to \(l+i-1\). \end{itemize}} Let \(C_{k,i}(n)\) denote the number of overpartitions of \(n\) whose non-overlined parts are not congruent to \(\pm i\) and \(2k-1\) modulo \(2k-1\). Then, \(C_{k,i}(n)=D_{k,i}(n)\).