Related papers: Combinatorial Formula for the Partition Function
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…
We derive the partition function of the one-body and two-body systems of classical noncommutative harmonic oscillator in two dimensions. Then, we employ the path integral approach to the quantum noncommutative harmonic oscillator and derive…
Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…
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…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
In the study of Hilbert schemes, the integer partition $\lambda$ helps researchers identify some geometric and combinatorial properties of the scheme in question. To aid researchers in extracting such information from a Hilbert polynomial,…
We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.
We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…
We consider a scalar-valued implicit function of many variables, and provide two closed formulae for all of its partial derivatives. One formula is based on products of partial derivatives of the defining function, the other one involves…
The purpose of this paper is to present a collection of interesting generating functions for partitions which have connections to positive definite binary quadratic forms. In establishing our results we obtain some new Bailey pairs.
Interpretations for the q-binomial coefficient evaluated at -q are discussed. A (q,t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.
In this paper we explore Kruyswijk's method and show how to obtain congruences for cubic partition. That apart we also examine inequalities for a(n) and provide upper bound for it in the fashion of the classic partition function p(n).
Motivated by string theory connection, a covariant procedure for perturbative calculation of the partition function of the two-dimensional generalized $\sigma$-model is considered. The importance of a consistent regularization of the…
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…
Using a property of the q-shifted factorial, an identity for q-binomial coefficients is proved, which is used to derive the formulas for the q-binomial coefficient for negative arguments. The result is in agreement with an earlier paper…
The partition function $p(n)$ has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the "circle method" to estimate the size of $p(n)$, which was later perfected…
In the paper we give consecutive description of functional methods of quantum field theory for systems of interacting q-particles. These particles obey exotic statistics and appear in many problems of condensed matter physics, magnetism and…
The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…