On the seventh order mock theta functions

@article{Hickerson1988OnTS,
  title={On the seventh order mock theta functions},
  author={Dean R. Hickerson},
  journal={Inventiones mathematicae},
  year={1988},
  volume={94},
  pages={661-677}
}
  • D. Hickerson
  • Published 1 October 1988
  • Mathematics
  • Inventiones mathematicae
In a recent paper [H], we proved the "Mock Theta Conjectures". These are identities, stated by Ramanujan in his "lost notebook" JR2, pp. 19-20], involving two of the 5th order mock 0-functions. In fact, Ramanujan gave one such identity for each of the ten 5th order functions; as shown in [A-G1], these ten identities are all equivalent to the two proved in I-HI. In this paper, we prove the corresponding identities for Ramanujan's 7th order mock 0-functions, and show how they are related to rank… 

FOUR IDENTITIES FOR THIRD ORDER MOCK THETA FUNCTIONS

In 2005, using a famous lemma of Atkin and Swinnerton-Dyer (Some properties of partitions, Proc. Lond. Math. Soc. (3) 4 (1954), 84–106), Yesilyurt (Four identities related to third order mock theta

A Survey of Classical Mock Theta Functions

In his last letter to Hardy, Ramanujan defined 17 functions M(q), | q | < 1, which he called mock θ-functions. He observed that as q radially approaches any root of unity ζ at which M(q) has an

Mock Theta Functions

The mock theta functions were invented by the Indian mathematician Srinivasa Ramanujan, who lived from 1887 until 1920. He discovered them shortly before his death. In this dissertation, I consider

The f(q) mock theta function conjecture and partition ranks

In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtaining formulas for Ne(n) (resp. No(n)), the number of partitions of n with even

MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS

In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtaining formulas for Ne(n) (resp. No(n)), the number of partitions of n with even

THE f(q) MOCK THETA FUNCTION CONJECTURE AND PARTITION RANKS

In 1944, Freeman Dyson initiated the study of ranks of integer partitions. Here we solve the classical problem of obtaining formulas for Ne(n) (resp. No(n)), the number of partitions of n with even

Vector-valued Modular Forms and the Seventh Order Mock Theta Functions

In 1988, Hickerson proved the mock theta conjectures (identities involving Ramanujan’s fifth order mock theta functions) using q-series methods. In a follow-up paper he proved three analogous

Dyson’s ranks and Maass forms

which were defined by Ramanujan and Watson decades ago. In his last letter to Hardy dated January 1920 (see pages 127-131 of [27]), Ramanujan lists 17 such functions, and he gives 2 more in his “Lost

Representations of mock theta functions

Motivated by the works of Liu, we provide a unified approach to find Appell-Lerch series and Hecke-type series representations for mock theta functions. We establish a number of parameterized

On Ramanujan’s definition of mock theta function

TLDR
Ramanujan’s definition of mock theta function is not equivalent to the modern definition, and Zwegers’ 2002 doctoral thesis showed that all of Ramanujan's examples are holomorphic parts of harmonic Maass forms.
...

References

SHOWING 1-10 OF 10 REFERENCES

The fifth and seventh order mock theta functions

. The theory of Bailey chains is extended to yield identities for Hecke type modular forms and related generalizations. The extended results allow us to produce Hecke type series for the fifth and

Dyson's crank of a partition

holds. He was thus led to conjecture the existence of some other partition statistic (which he called the crank); this unknown statistic should provide a combinatorial interpretation of ^-p(lln + 6)

An Introduction to the Theory of Numbers

This is the fifth edition of a work (first published in 1938) which has become the standard introduction to the subject. The book has grown out of lectures delivered by the authors at Oxford,

New combinatorial interpretations of Ramanujan’s partition congruences mod 5,7 and 11

Soit p(n) le nombre de partitions non restreintes de n. On donne de nouvelles interpretations combinatoires des congruences p(5n+4), p(7n+5) et p(11n+6)≡0 (mod 5,7 et 11, respectivement)

Mappings and symmetries of partitions

  • F. Dyson
  • Mathematics
    J. Comb. Theory, Ser. A
  • 1989