Partitions and Sylvester waves
Abstract
The restricted partition function pN(n) counts the partitions of the integer n into at most N parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and, for the first time, show the asymptotics of the initial waves as N and n both go to infinity at about the same rate. This allows us to see when the initial waves are a good approximation to pN(n) in this situation. Our proofs employ the saddle-point method of Perron and the dilogarithm.
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.