Related papers: Exact Formulae for the Fractional Partition Functi…

We study the Fermi gas quantum mechanics associated to the ABJM matrix model. We develop the method to compute the grand partition function of the ABJM theory, and compute exactly the partition function Z(N) up to N=9 when the Chern-Simons…

Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…

We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value $L(\tfrac 12,f\times (\tfrac{q}{\cdot}))$ in the $q$ and…

An extension of the method and results of A. Schwarz for evaluating the partition function of a quadratic functional is presented. This enables the partition functions to be evaluated for a wide class of quadratic functionals of interest in…

Here we prove that Benford's law holds for coefficients of an infinite class of modular forms. Expanding the work of Bringmann and Ono on exact formulas for harmonic Maass forms, we derive the necessary asymptotics. This implies that the…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

We propose an approach for approximating the partition function which is based on two steps: (1) computing the partition function of a simplified model which is obtained by deleting model edges, and (2) rectifying the result by applying an…

Let $p(n)$ be the number of partition of a positive integer $n$. We derive a new identity for complete Bell polynomials based on a generating function of $p(7n+5)$ given by Ramanujan.

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

We present some Euler-type recurrences for the partition function $p(n)$.

Zero-free based algorithm is a major technique for deterministic approximate counting. In Barvinok's original framework[Bar17], by calculating truncated Taylor expansions, a quasi-polynomial time algorithm was given for estimating zero-free…

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 derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

We derive an exact path integral formulation for the partition function for the Ising model using a mapping between spins and poles of a Laurent expansion for a field on the complex plane. The advantage in using this formulation for the…

The partition perimeter is a statistic defined to be one less than the sum of the number of parts and the largest part. Recently, Amdeberhan, Andrews, and Ballantine proved the following analog of Glaisher's theorem: for all $m \geq 2$ and…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

We derive an explicit formula for a restricted partition function P_n^m(s) with constraints making use of known expression for a restricted partition function W_m(s) without constraints

We explore an instance of the question of partitioning a polygon into pieces, each of which is as ``circular'' as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of…

Fragmentation functions for hadrons composed of heavy quarks are calculated directly from the definitions given by Collins and Soper and are compared with those calculated in another way. A new fragmentaion function for a P-wave meson is…

We obtain congruences for the number a(n) of cubic partitions using modular forms. The notion of cubic partitions is introduced by Chan and named by Kim in connection with Ramanujan's cubic continued fractions. Chan has shown that a(n) has…