Simple upper bounds for partition functions

被引:0
|
作者
Wladimir de Azevedo Pribitkin
机构
[1] CUNY,Department of Mathematics, College of Staten Island
来源
The Ramanujan Journal | 2009年 / 18卷
关键词
Partitions; Dilogarithm; 11P81;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:113 / 119
页数:6
相关论文
共 50 条