2000 character limit reached
Effective Congruences for Mock Theta Functions
Published 10 Apr 2013 in math.NT | (1304.3136v1)
Abstract: Let M(q)=\sum c(n) qn be one of Ramanujan's mock theta functions. We establish the existence of infinitely many linear congruences of the form c(An+B) \equiv 0 (mod \ellj), where A is a multiple of \ell and an auxiliary prime p. Moreover, we give an effectively computable upper bound on the smallest such p for which these congruences hold. The effective nature of our results is based on prior works of Lichtenstein and Treneer.
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.