Power partitions
From MaRDI portal
Publication:5964527
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
(29)- Powerposets
- Counting the number of solutions to certain infinite Diophantine equations
- Power partitions and saddle-point method
- Partitions with multiplicities associated with divisor functions
- The partition function revisited
- Bounds on the Möbius-signed partition numbers
- Partitions into Segal-Piatestki-Shapiro sequences
- Will the real Hardy-Ramanujan formula please stand up?
- POWER PARTITIONS AND SEMI--FIBONACCI PARTITIONS
- The saddle-point method for general partition functions
- Power partitions and a generalized eta transformation property
- Asymptotic formulae for mixed congruence stacks
- On Fibonacci partitions
- On the \(k\)th root partition function
- A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
- Some observations and speculations on partitions into \(d\)-th powers
- Lifshitz scaling, microstate counting from number theory and black hole entropy
- On the \(r\)-th root partition function. II.
- Actions of divided differences on modified powers
- Polynomial partition asymptotics
- Detailed asymptotic expansions for partitions into powers
- Khinchin families and Hayman class
- The anisotropic chiral boson
- Partitions into \(k\)th powers of terms in an arithmetic progression
- PARTITIONS INTO PRIME POWERS
- Equidistribution of Heegner points and the partition function
- Bijections, generalizations, and other properties of sequentially congruent partitions
- Khinchin families, set constructions, partitions and exponentials
- Turán inequalities for \(k\)-th power partition functions
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)