Power partitions and saddle-point method

Abstract

For k≥slant 1, denote by pk(n) the number of partitions of an integer n into k-th powers. In this note, we apply the saddle-point method to provide a new proof for the well-known asymptotic expansion of pk(n). This approach turns out to significantly simplify those of Wright (1934), Vaughan (2015) and Gafni (2016).

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…