Asymptotic formulae for partition ranks
Number Theory
2015-10-01 v1 Combinatorics
Abstract
Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
Keywords
Cite
@article{arxiv.1406.6848,
title = {Asymptotic formulae for partition ranks},
author = {Jehanne Dousse and Michael H. Mertens},
journal= {arXiv preprint arXiv:1406.6848},
year = {2015}
}