A different way to sort \(M\)-order, colored generalized Frobenius partitions (Q1907857): Difference between revisions

An \(M\)-order, colored, generalized Frobenius partition of \(n\) is a pair of colored partitions using \(M\) colors for which, for some \(r\), each partition has exactly \(r\) parts, the sum of all parts in both partitions is \(n- r\), in each partition parts of the same color are distinct, and the pair of partitions has order \(M\) under cyclic permutations of the colors. The number of such generalized Frobenius partitions of \(n\) is denoted by \(\overline{c\phi_M}(n)\). The author proves that \[ \overline{c\phi_{10}}(n)= 5\overline{c\phi_2}(5n- 2)\quad\text{and} \quad \overline{c\phi_9}(n)= 3\overline{c\phi_3} (3n- 1). \]