Related papers: The partition function $p(n)$ in terms of the clas…
An interplay between the Lambert series and Euler's Pentagonal Number Theorem gives an Euler-type recurrence relation for any given arithmetical function. As consequences of this, we present Euler-type recurrence relations for some…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…
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…
An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…
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…
Recently, Andrews, Dixit and Yee defined two partition functions $p_{\omega}(n)$ and $p_{\nu}(n)$ that are related with Ramanujan's mock theta functions $\omega(q)$ and $\nu(q)$, respectively. In this paper, we present two variable…
This paper analyzes the M\"obius ($\mu(i)$) function defined on the partially ordered set of triangular numbers ($\mathcal T(i)$) under the divisibility relation. We make conjectures on the asymptotic behavior of the classical M\"obius and…
The paper presents some results for reducing the computation of the M\"obius functon of a M\"obius category that arises from a combinatorial inverse semigroup to that of locally finite partially ordered sets. We illustrate the computation…
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…
Building on work of Hardy and Ramanujan, Rademacher proved a well-known formula for the values of the ordinary partition function $p(n)$. More recently, Bruinier and Ono obtained an algebraic formula for these values. Here we study the…
We evaluate partition functions of matrix models which are given by topologically twisted and dimensionally reduced actions of d=4 N=1 super Yang-Mills theories with classical (semi-)simple gauge groups, SO(2N), SO(2N+1) and USp(2N). The…
We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…
The partition function is an essential quantity in statistical mechanics, and its accurate computation is a key component of any statistical analysis of quantum system and phenomenon. However, for interacting many-body quantum systems, its…
The partition function of composite bosons ("cobosons" for short) is calculated in the canonical ensemble, with the Pauli exclusion principle between their fermionic components included in an exact way through the finite temperature…
New formulas are given for the grand partition function of paraboson systems of order p with n orbitals and parafermion systems of order p with m orbitals. These formulas allow the computation of statistical and thermodynamic functions for…
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…
Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
In classical statistical mechanics, the partition function is defined in phase space. We extend this concept to quantum statistical mechanics using Bohmian trajectories. The quantum partition function in phase space captures the ensemble of…