On Erdős's method for bounding the partition function
From MaRDI portal
Abstract: For fixed and , take to be the set of positive integers congruent modulo to one of the elements of , and let be the number of ways to write as a sum of elements of . Nathanson proved that using a variant of a remarkably simple method devised by ErdH{o}s in order to bound the partition function. In this short note we describe a simpler and shorter proof of Nathanson's bound.
Recommendations
Cites work
Cited in
(6)- Exact limit theorems for restricted integer partitions
- scientific article; zbMATH DE number 1944014 (Why is no real title available?)
- scientific article; zbMATH DE number 1989999 (Why is no real title available?)
- scientific article; zbMATH DE number 2057974 (Why is no real title available?)
- scientific article; zbMATH DE number 1404448 (Why is no real title available?)
- An upper bound on the mean value of the Erdős–Hooley Delta function
This page was built for publication: On Erdős's method for bounding the partition function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379610)