2000 character limit reached
On a conjecture about prime-detecting quasimodular forms
Published 30 Jun 2025 in math.NT | (2507.00147v1)
Abstract: Motivated by weighted partition of $n$ that vanish if and only if $n$ is a prime, Craig, van Ittersum, and Ono conjecture a classification of quasimodular forms which detect primes in the sense that the $n$-th Fourier coefficient vanishes if and only if $n$ is a prime. In this paper, we prove this conjecture by showing that Fourier coefficients of quasimodular cusp forms exhibit infinitely many sign changes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.