A lower bound for the partition function from Chebyshev's inequality applied to a coin flipping model for the random partition
classification
🧮 math.CO
keywords
partitionboundchebyshevcoinflippinginequalitylowermodel
read the original abstract
We use a coin flipping model for the random partition and Chebyshev's inequality to prove the lower bound $\lim \frac{\log p(n)}{\sqrt{n}} \ge C$ for the number of partitions $p(n)$ of $n$, where $C$ is an explicit constant.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.