Published July 31, 2003
| Version v1
Journal article
Open
On Elementary Lower Bounds for the Partition Function
Authors/Creators
- 1. School of Mathematics and Statistics, University of Birmingham, Birmingham B15 2TT, United Kingdom
Description
We present two analogues of two well-known elementary arguments for a lower bound for p(n), the number of partitions of the integer n. One of these is character-theoretic, and the other relies on partition combinatorics developed and used in the theory of representations of the symmetric group. We show that these arguments provide better lower estimates. We also give an application.