On a conjecture of Andrews (Q5894751)

For an even integer \(\lambda\), let \(A_{\lambda,k,a}(n)\) denote the number of partitions of \(n\) into parts such that no part \(\not \equiv 0 \text{ mod } (\lambda+1)\) may be repeated and no part is \(\equiv 0\), \(\pm (a-\lambda/2) (\lambda + 1) \text{mod} (2k-\lambda + 1) (\lambda+1)\). For an odd integer \(\lambda\), let \(A_{\lambda, k,a}(n)\) denote the number of partitions of \(n\) into parts such that no part \(\not \equiv 0 \text{mod} (\lambda + 1)/2\) may be repeated, no part is \(\equiv \lambda + 1 \text{mod} (2\lambda + 2)\) and no part is \(\equiv 0\), \(\pm (2a - \lambda) (\lambda + 1)/2 \text{mod} (2k - \lambda + 1) (\lambda+1)\). Let \(B_{\lambda, k,a} (n)\) denote the number of partitions of \(n\) of the form \(b_ 1+\cdots+b_ s\) with \(b_ i \geq b_{i+1}\), no part \(\not \equiv 0\text{ mod} (\lambda+1)\) is repeated, \(b_ i - b_{i+k- 1} \geq \lambda + 1\) with strict inequality if \(\lambda+1\) divides \(b_ i\), \(f_ j + \cdots + f_{\lambda-j+1} \leq a-j\) for \(1 \leq j \leq (\lambda + 1)/2\) and \(f_ 1 + \cdots + f_{\lambda + 1} \leq a-1\) where \(f_ i\) is the number of appearances of \(i\) in the partition. From the Rogers-Ramanujan-Göllnitz-Gordon-Andrews identities (cf. \(\lambda=0,1)\) \textit{G. E. Andrews} [Mem. Am. Math. Soc. 152, 1-86 (1974; Zbl 0296.10010)] conjectured for \(\lambda/2<a \leq k<\lambda\), \[ B_{\lambda, k,a} (n) = A_{\lambda, k,a} (n) \quad \text{if} \quad n<{k + \lambda - a+1 \choose 2} + (k - \lambda + 1) (\lambda+1), \] while \[ B_{\lambda,k,a} (n) = A_{\lambda, k,a} (n) + 1 \quad \text{when} \quad n = {k + \lambda - a+1 \choose 2} + (k - \lambda + 1) (\lambda + 1). \] In the paper under review the authors prove the case \(k=a\) of the above conjecture.