Simple upper bounds for partition functions
From MaRDI portal
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}\).
Recommendations
- scientific article; zbMATH DE number 4152494
- A simply-obtained upper bound for overpartitions
- scientific article; zbMATH DE number 1989999
- An effective bound for the partition function
- scientific article; zbMATH DE number 1532442
- scientific article; zbMATH DE number 1263951
- New upper bounds for the number of partitions into a given number of parts
- scientific article; zbMATH DE number 3981252
- A New Class of Upper Bounds on the Log Partition Function
- A Bound for the Number of Multiplicative Partitions
Cites work
- A Convergent Series for the Partition Function p ( n )
- Elementary Methods in Number Theory
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 1185230 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 575872 (Why is no real title available?)
- scientific article; zbMATH DE number 803259 (Why is no real title available?)
- scientific article; zbMATH DE number 3399320 (Why is no real title available?)
- scientific article; zbMATH DE number 3104604 (Why is no real title available?)
- On the Partition Function p (n )
- Revisiting Rademacher's formula for the partition function \(p(n)\)
- The distribution of the number of summands in the partitions of a positive integer
Cited in
(25)- Gaussian polytopes: a cumulant-based approach
- A Polyakov formula for sectors
- Effective bounds for Fourier coefficients of certain weakly holomorphic modular forms
- Divisor sequences of atoms in Krull monoids
- On explaining integer vectors by few homogeneous segments
- Estimates for the norms of products of sines and cosines
- Polynomial approximation of anisotropic analytic functions of several variables
- On the cardinality of lower sets and universal discretization
- On Erdős's method for bounding the partition function
- On the Malle-Navarro conjecture for 2- and 3-blocks of general linear and unitary groups
- scientific article; zbMATH DE number 3981252 (Why is no real title available?)
- scientific article; zbMATH DE number 1989999 (Why is no real title available?)
- scientific article; zbMATH DE number 2057974 (Why is no real title available?)
- On the involution fixity of simple groups
- Parameterized Algorithms for Partitioning Graphs into Highly Connected Clusters
- On the dimension of matrix embeddings of torsion-free nilpotent groups
- Quasi-Monte Carlo and multilevel Monte Carlo methods for computing posterior expectations in elliptic inverse problems
- On the number of conjugacy classes of a primitive permutation group
- Estimates on binomial sums of partition functions
- On the parameterized complexity of the acyclic matching problem
- A comparison of Integer partitions based on smallest part
- Cup product persistence and its efficient computation
- Isodiametric inequality for vector spaces
- On number of partitions of an integer into a fixed number of positive integers
- A shortest path-based approach to the multileaf collimator sequencing problem
This page was built for publication: Simple upper bounds for partition functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039627)
