Congruences for Frobenius partitions (Q1912310)

A generalized Frobenius partition of a positive integer \(n\) is a two-rowed array of nonnegative integers \({{a_1 a_2 \dots a_k} \choose {b_1 b_2 \dots b_k}}\), where the entries in each row are arranged in nonincreasing order and \(n= k+ a_1+ \dots+ a_k+ b_1+ \dots+ b_k\). A generalized Frobenius partition in 3 colours is an array of the above form where the entries are taken from 3 distinct copies of the nonnegative integers distinguished by colour and the rows are ordered first by size and then by colour with no two consecutive like entries in any row. \textit{L. W. Kolitsch} [J. Number Theory 33, 220-223 (1989; Zbl 0679.10014); Analytic number theory, Prog. Math. 85, 343-348 (1990; Zbl 0721.11040)] investigated congruence properties for the number of certain coloured generalized Frobenius partitions. Let \(c_3 (n)\) denote the number of generalized Frobenius partitions of \(n\) in 3 colours. The number of ordinary partitions of \(n\) is denoted by \(p(n)\). In the paper under review the author proves the following congruences: \(c_3 (63n+ 50) \equiv 0\bmod 7\). If \(n\not\equiv 2\pmod 3\) and \(n\neq 3m (m+1) /2\) for any positive integer \(m\) then \(c_3 (5n+ 2)\equiv 0\bmod 5\). If \(n\equiv 2 \bmod 3\) then \(c_3 (5n+ 2)\equiv p((5n+ 2)/3) \bmod 5\) and \(c_3 (15m (m+1) 2^{-1} +2)\equiv (-1)^{m +1} (m+3) \bmod 5\). These congruences are proved by constructing holomorphic modular forms which inherit related congruence properties which are verified computationally via Sturm's criterion. The reader should beware of many misprints. E.g., in (3) on page 170 and in Main Theorem 2 on page 178, the exponent of \((-1)\) should be \(m+1\) (instead of \(m\)).