A Rademacher-type exact formula for partitions without sequences
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
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.