N-colored generalized Frobenius partitions: Generalized Kolitsch identities
Abstract
Let N≥ 1 be squarefree with (N,6)=1. Let cφN(n) denote the number of N-colored generalized Frobenius partition of n introduced by Andrews in 1984. We prove cφN(n)= Σd N N/d · P( Nd2n - N2-d224d2 ) + b(n) where C(z) := (q;q)N∞Σn=1∞ b(n) qn is a cusp form in S(N-1)/2 (0(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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.