A lower bound for the partition function from Chebyshev's inequality applied to a coin flipping model for the random partition

2019/05/25 by Wildon, Mark
#05A17 #Combinatorics (math.CO) #FOS: Mathematics #Secondary: 60C05

paper · doi:10.48550/arxiv.1905.10590

Abstract

We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound lim (log p(n))/(√(n)) ≥ C for the number of partitions p(n) of n, where C is an explicit constant.

Related

• Combinatorial proof of an inequality on some partitions separated by parity
• Counting Partitions on the Abacus
• On elementary estimates for the partition function
• Asymptotic density and the asymptotics of partition functions
• Number of partitions of n with a given parity of the smallest part