Related papers: Combinatorial Formula for the Partition Function
Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…
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…
In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…
We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.
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…
Fourier expansion of the integrand in the path integral formula for the partition function of quantum systems leads to a deterministic expression which, though still quite complex, is easier to process than the original functional integral.…
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.
We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
A new recursive procedure for calculation of restricted partition function is suggested. An explicit formula for the restricted partition function is found based on this procedure.
In this paper we revisit the work of E.T. Bell concerning partition polynomials in order to introduce the reciprocal partition polynomials. We give their explicit formulas and apply the result to compute closed formulae for some well-known…
In this paper, first we introduce a quantity called a partition function for a quiver mutation sequence. The partition function is a generating function whose weight is a $q$-binomial associated with each mutation. Then, we show that the…
In this paper, we investigate decompositions of the partition function $p(n)$ from the additive theory of partitions considering the famous M\"{o}bius function $\mu(n)$ from multiplicative number theory. Some combinatorial interpretations…
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
MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…
We describe a unified approach to calculating the partition functions of a general multi-level system with a free Hamiltonian. Particularly, we present new results for parastatistical systems of any order in the second quantized approach.…
Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset…
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…
Let $p_{k}(n)$ be the coefficient of $q^n$ in the series expansion of $(q;q)_{\infty}^{k}$. It is known that the partition function $p(n)$, which corresponds to the case when $k=-1$, satisfies congruences such as $p(5n+4)\equiv 0\pmod{5}$.…