Simple upper bounds for partition functions (Q1039627)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 5636932
Language Label Description Also known as
default for all languages
No label defined
    English
    Simple upper bounds for partition functions
    scientific article; zbMATH DE number 5636932

      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

      Identifiers