On Erdős’s Method for Bounding the Partition Function

Asaf Cohen Antonir*, Asaf Shapira

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

For fixed m and (Formula presented.), take A to be the set of positive integers congruent modulo m to one of the elements of R, and let (Formula presented.) be the number of ways to write n as a sum of elements of A. Nathanson proved that (Formula presented.) using a variant of a remarkably simple method devised by Erdős in order to bound the partition function. In this short note, we describe a simpler and shorter proof of Nathanson’s bound.

Original languageEnglish
Pages (from-to)744-747
Number of pages4
JournalAmerican Mathematical Monthly
Volume128
Issue number8
DOIs
StatePublished - 2021

Funding

FundersFunder number
NSF-BSF2019679
European Commission633509
Israel Science Foundation1028/16

    Keywords

    • 05A17
    • MSC: Primary 11P81
    • Secondary 11P83

    Fingerprint

    Dive into the research topics of 'On Erdős’s Method for Bounding the Partition Function'. Together they form a unique fingerprint.

    Cite this