Simple upper bounds for partition functions (Q1039627): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11139-007-9022-z / rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
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 | |||
Property / cites work | |||
Property / cites work: Q4218535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4293454 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The distribution of the number of summands in the partitions of a positive integer / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5843362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3838156 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Elementary Methods in Number Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4850056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Revisiting Rademacher's formula for the partition function \(p(n)\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Convergent Series for the Partition Function <i>p</i> ( <i>n</i> ) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Partition Function <i>p</i> (<i>n</i> ) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5666618 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3243274 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11139-007-9022-Z / rank | |||
Normal rank |
Latest revision as of 15:24, 10 December 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