Answers are grounded in this paper and cite their sources.
Let N≥ 1 be squarefree with $(N,6)=1$ . Let cφ N(n) denote the number of N -colored generalized Frobenius partitions of n introduced by Andrews in 1984, and $P(n)$ denote the number of partitions of n . We prove align*cφN(n)= ∑d N N/d · P( N/d²n - N²-d²/24d² ) + b(n),align* where C(z) := (q;q)N_∞ ∑ ₙ₌₁∞ b(n) qⁿ is a cusp form in S(N-1)/2 (Γ ₀(N),χ N) . This extends and strengthens earlier results of Kolitsch and Chan–Wang–Yan treating the case when N is a prime. As an immediate application, we obtain an asymptotic formula for cφ N(n) in terms of the classical partition function $P(n)$ .
No takes yet. Share an insight, caveat, or question.
Aygin et al. (2022) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: