Related papers: On elementary estimates for the partition function

The partition function, $p_A(n)$, is defined to be the number of partitions of $n$ with parts in the set A, where $n$ is a positive integer and $A$ is a set of positive integers. It is well documented that: if A is a finite set with…

We propose a method for obtaining rigorous and accurate upper and lower bounds on the eigenvalues of ordinary and partial differential operators in bounded regions of Euclidean space. It uses a boundary condition homotopy method starting…

We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

We present a theory of ultradistributional boundary values for harmonic functions defined on the Euclidean unit ball. We also give a characterization of ultradifferentiable functions and ultradistributions on the sphere in terms of their…

This paper addresses the problem of optimizing partition functions in a stochastic learning setting. We propose a stochastic variant of the bound majorization algorithm that relies on upper-bounding the partition function with a quadratic…

We provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

Let $p(n)$ denote the partition function and define $p(n,k)=\sum_{j=0}^{k}\binom{n-j}{k-j}p(j)$ where $p(0)=1$. We prove that $p(n,k)$ is unimodal and satisfies $p(n,k) < \frac{2.825}{\sqrt{n}}\, 2^n $ for fixed $n\ge 1$ and all $1\le k\le…

We study 4d $\mathcal{N}=1$ supersymmetric theories on a compact Euclidean manifold of the form $S^1 \times\mathcal{M}_3$. Partition functions of gauge theories on this background can be computed using localization, and explicit formulas…

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…

We give a simple proof of the fact that an "$f$-estimate" for the $\bar\partial$-Neumann problem implies a lower bound on the geomatric type of the boundary along any complex one dimensional variety. The proof uses the existence of peak…

We perform the calculation of the partition function of the Poisson-sigma model on the world sheet with the topology of a two-dimensional disc. Considering the special case of a linear Poisson structure we recover the partition function of…

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

We consider the problem of partitioning the node set of a graph into $k$ sets of given sizes in order to \emph{minimize the cut} obtained using (removing) the $k$-th set. If the resulting cut has value $0$, then we have obtained a vertex…

This manuscript is intended as an accompaniment to Guth's "A restriction estimate using polynomial partitioning". We begin by summarizing the core ideas of the proof, elaborating the history and development of the techniques therein. From…

Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…

An elementary, albeit higher dimensional, argument is used to compute the area under the power function curve between 0 and 1.

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…