, Volume 18, Issue 1, pp 113-119

Simple upper bounds for partition functions

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We tweak Siegel’s method to produce a rather simple proof of a new upper bound on the number of partitions of an integer into an exact number of parts. Our approach, which exploits the delightful dilogarithm function, extends easily to numerous other counting functions.

This work was supported by PSC/CUNY Research Awards (# 67261-00 36 and # 68327-00 37).