Related papers: Exact Formulae for the Fractional Partition Functi…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
We provide an exact expression of the moment of the partition function for random energy models of finite system size, generalizing an earlier expression for a grand canonical version of the discrete random energy model presented by the…
The Hardy-Ramanujan formula for the number of integer partitions of $n$ is one of the most popular results in partition theory. While the unabridged final formula has been celebrated as reflecting the genius of its authors, it has become…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
The partition function by means of the static path approximation (SPA) plus the random-phase approximation (RPA) treatment can be written as a contour integral form without solving the RPA equations for a separable interaction. This method…
Fractional operators (derivatives/integrals) are defined via the integration of the functions. When the function is produced by a spanning set of fractional power functions, traditional quadrature rules often need to be revised, failing to…
In recent years, there has been extensive work on inequalities among partition functions. In particular, Nicolas, and independently DeSalvo--Pak, proved that the partition function $p(n)$ is eventually log-concave. Inspired by this and…
A classical result from analytic number theory by Rademacher gives an exact formula for the Fourier coefficients of modular forms of non-positive weight. We apply similar techniques to study the spectrum of two-dimensional unitary conformal…
A recent paper examined the global structure of integer partitions sequences and, via combinatorial analysis using modular arithmetic, derived a closed form expression for a map from (N, M) to the set of all partitions of a positive integer…
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
Partition density functional theory is a formally exact procedure for calculating molecular properties from Kohn-Sham calculations on isolated fragments, interacting via a global partition potential that is a functional of the fragment…
A formula for supershell partition functions, which play a major role in the Super Transition Array approach to radiative-opacity calculations, is derived as a functional of the distribution of energies within the supershell. It consists in…
When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach…
We calculate the partition function of a gas of particles obeying Haldane exclusion statistics, using a definition of a Hilbert space having a `fractional dimension' and constructing appropriate coherent states. The fractional dimension is…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…
In this work an approximate analytic expression for the quantum partition function of the quartic oscillator described by the potential $V(x) = \frac{1}{2} \omega^2 x^2 + g x^4$ is presented. Using a path integral formalism, the exact…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our…