2000 character limit reached
Prime detecting quasi-modular forms in higher level
Published 6 Nov 2025 in math.NT | (2511.04030v1)
Abstract: In a previous work, the authors resolved a conjecture about the structure of prime-detecting quasi-modular forms by studying sign changes occurring in quasi-modular cusp forms. In this paper, we extend the considerations to prime-detecting quasi-modular forms of higher level, in particular describing the structure of the space of quasi-modular forms that detect primes in various arithmetic progressions. We also provide an ``analytic'' proof of the level one case.
Paper Prompts
Sign up for free to create and run prompts on this paper.