Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Rademacher-type exact formula for partitions without sequences

Published 3 Apr 2023 in math.NT and math.CO | (2304.01377v2)

Abstract: In this paper we prove an exact formula for the number of partitions without sequences. By work of Andrews, the corresponding generating function is a product of a modular form and a mock theta function, giving an overall weight of 0. The proof requires evaluating and bounding Kloosterman sums and the Circle Method

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.