Effective Congruences for Mock Theta Functions
classification
🧮 math.NT
keywords
congruenceseffectivefunctionsmockthetaauxiliaryboundcomputable
read the original abstract
Let M(q)=\sum c(n) q^n 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 \ell^j), 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.