Recurrences for 2-colored and 3-colored F-partitions (Q1923531): Difference between revisions

A generalized Frobenius partition of a positive integer \(n\) is a two-rowed array of nonnegative integers \(\left( \begin{smallmatrix} a_1 & a_2 & \cdots & a_r \\ b_1 & b_2 & \cdots & b_r \end{smallmatrix} \right)\), where the entries in each row are arranged in nonincreasing order and \(n= r+a_1+ \cdots + a_r+b_1 + \cdots + b_r\). \textit{G. E. Andrews} [Mem. Am. Math. Soc. 301 (1984; Zbl 0544.10010)] studied the number \(c\varphi_m (n)\) of generalized Frobenius partitions of \(n\) into distinct parts with \(m\) colours. \textit{L. W. Kolitsch} [J. Number Theory 33, 220-223 (1989; Zbl 0679.10014); J. Number Theory 39, 279-284 (1991; Zbl 0734.11052)] introduced \(\overline{c\varphi}_m(n)\), which denotes the number of generalized Frobenius partitions of \(n\) into distinct parts with \(m\) colours whose order is \(m\) under cyclic permutation of the \(m\) colours. In the paper under review the author proves recurrence relations for \(\overline {c\varphi}_2 (n)\) and \(\overline {c \varphi}_3 (n)\).