Papers
Topics
Authors
Recent
Search
2000 character limit reached

On three theorems of Folsom, Ono and Rhoades

Published 9 Sep 2013 in math.NT, math.CA, and math.CO | (1309.2053v2)

Abstract: In his deathbed letter to Hardy, Ramanujan gave a vague definition of a mock modular function: at each root of unity its asymptotics matches the one of a modular form, though a choice of the modular function depends on the root of unity. Recently Folsom, Ono and Rhoades have proved an elegant result about the match for a general family related to Dyson's rank (mock theta) function and the Andrews--Garvan crank (modular) function---the match with explicit formulae for implied $O(1)$ constants. In this note we give another elementary proof of Ramanujan's original claim and outline some heuristics which may be useful for obtaining a new proof of the general Folsom--Ono--Rhoades theorem.

Authors (1)

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.

Collections

Sign up for free to add this paper to one or more collections.