English

N-colored generalized Frobenius partitions: Generalized Kolitsch identities

Number Theory 2021-04-22 v1 Combinatorics

Abstract

Let N1N\geq 1 be squarefree with (N,6)=1(N,6)=1. Let cϕN(n)c\phi_N(n) denote the number of NN-colored generalized Frobenius partition of nn introduced by Andrews in 1984. We prove cϕN(n)=dNN/dP(Nd2nN2d224d2)+b(n) c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d^2}n - \frac{N^2-d^2}{24d^2} \right) + b(n) where C(z):=(q;q)Nn=1b(n)qnC(z) := (q;q)^N_\infty\sum_{n=1}^{\infty} b(n) q^n is a cusp form in S(N1)/2(Γ0(N),χN)S_{(N-1)/2} (\Gamma_0(N),\chi_N). This extends and strengthens earlier results of Kolitsch and Chan-Wang-Yan treating the case when NN is a prime. As an immediate application, we obtain an asymptotic formula for cϕN(n)c\phi_N(n) in terms of the classical partition function.

Keywords

Cite

@article{arxiv.2104.10250,
  title  = {N-colored generalized Frobenius partitions: Generalized Kolitsch identities},
  author = {Zafer Selcuk Aygin and Khoa D. Nguyen},
  journal= {arXiv preprint arXiv:2104.10250},
  year   = {2021}
}
R2 v1 2026-06-24T01:23:03.505Z