Abstract: In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for , the number of partitions of a number into -th powers. In this paper, we provide an asymptotic formula for , using the Hardy-Littlewood Circle Method. We also provide a formula for the difference function . As a necessary step in the proof, we obtain a non-trivial bound on exponential sums of the form .
Recommendations
Cites work
Cited in
(34)- Polynomial partition asymptotics
- Asymptotic formulae for mixed congruence stacks
- Strange and pseudo-differentiable functions with applications to prime partitions
- Lifshitz scaling, microstate counting from number theory and black hole entropy
- Power partitions and saddle-point method
- Testability of positive integers
- Detailed asymptotic expansions for partitions into powers
- Will the real Hardy-Ramanujan formula please stand up?
- End behavior of Ramanujan's taxicab numbers
- Counting the number of solutions to certain infinite Diophantine equations
- Power partitions and a generalized eta transformation property
- Khinchin families and Hayman class
- PARTITIONS INTO PRIME POWERS
- Turán inequalities for k-th power partition functions
- Some observations and speculations on partitions into \(d\)-th powers
- Actions of divided differences on modified powers
- On Fibonacci partitions
- A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
- POWER PARTITIONS AND SEMI--FIBONACCI PARTITIONS
- Bounds on the Möbius-signed partition numbers
- Partitions into Segal-Piatestki-Shapiro sequences
- Partitions with multiplicities associated with divisor functions
- Exponential sums over Möbius convolutions with applications to partitions
- Equidistribution of Heegner points and the partition function
- On the \(k\)th root partition function
- The anisotropic chiral boson
- The saddle-point method for general partition functions
- Powerposets
- On the \(r\)-th root partition function. II.
- Equidistribution and inequalities for partitions into powers
- Bijections, generalizations, and other properties of sequentially congruent partitions
- Khinchin families, set constructions, partitions and exponentials
- Partitions into \(k\)th powers of terms in an arithmetic progression
- The partition function revisited
This page was built for publication: Power partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5964527)