Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exact formulae for ranks of partitions

Published 10 Jun 2024 in math.NT | (2406.06294v1)

Abstract: In 2009, Bringmann arXiv:0708.0691 [math.NT] used the circle method to prove an asymptotic formula for the Fourier coefficients of rank generating functions. In this paper, we prove that Bringmann's formula, when summing up to infinity and in the case of prime modulus, gives a Rademacher-type exact formula involving sums of vector-valued Kloosterman sums. As a corollary, in an upcoming paper, we will provide a new proof of Dyson's conjectures by showing that the certain Kloosterman sums vanish.

Authors (1)
Citations (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.