Papers
Topics
Authors
Recent
Search
2000 character limit reached

N-colored generalized Frobenius partitions: Generalized Kolitsch identities

Published 20 Apr 2021 in math.NT and math.CO | (2104.10250v1)

Abstract: Let N≥1N\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)=∑d∣NN/d⋅P(Nd<sup>2n</sup>−N<sup>2−d<sup>224d<sup>2</sup></sup></sup>)+b(n) c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d<sup>2}n</sup> - \frac{N<sup>2-d<sup>2}{24d<sup>2}</sup></sup></sup> \right) + b(n) where C(z):=(q;q)<sup>N∞∑n=1<sup>∞</sup></sup>b(n)q<sup>nC(z) := (q;q)<sup>N_\infty\sum_{n=1}<sup>{\infty}</sup></sup> b(n) q<sup>n is a cusp form in S(N−1)/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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.