Simple upper bounds for partition functions (Q1039627): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11139-007-9022-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2077614283 / rank | |||
Normal rank |
Revision as of 21:27, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simple upper bounds for partition functions |
scientific article |
Statements
Simple upper bounds for partition functions (English)
0 references
23 November 2009
0 references
The author proves the following Theorem: Let \(p_k(n)\) denote the number of partitions of \(n\) with exactly \(k\) parts. There exists an absolute constant \(A<1\) such that for \(k<n\) \[ p_k(n)<A\frac{e^{c\sqrt{n-k}}}{(n-k)^{3/4}}e^{-\frac{2\sqrt{n-k}}{c}\text{Li}_2(e^{-\frac{c(k+1/2)}{2\sqrt{n-k}}})}, \] where \(\text{Li}_2(x)=\sum_{m=1}^\infty\frac{x^m}{m^2}\), \(|x|\leq 1\), is the dilogarithm function, and \(c=\pi\sqrt{2/3}\).
0 references
partition function
0 references
upper bound
0 references