Detailed asymptotic expansions for partitions into powers
Abstract
Here we examine the number of ways to partition an integer n into kth powers when n is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion coefficients. The convexity and log-concavity of these partitions is shown for large n, and the stronger conjectures of Ulas are proved. The asymptotics of Wright's generalized Bessel functions are also treated.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.