Related papers: A formula for the partition function that "counts"
In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…
In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…
Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…
In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…
We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…
We introduce the quasi-partition algebra $QP_k(n)$ as a centralizer algebra of the symmetric group. This algebra is a subalgebra of the partition algebra and inherits many similar combinatorial properties. We construct a basis for…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
A Rademacher-type convergent series formula which generalizes the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ and the Zuckerman formula for the Fourier coefficients of $\vartheta_4(0\vert \tau)^{-1}$ is presented.
In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…
Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).
Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
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}$.…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…
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…
For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…
We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…
In 1939, H. S. Zuckerman provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the overpartition function $\overline{p}(n)$. Computing $\overline{p}(n)$ by this method requires…
We define an $f$-restricted partition $p_f(n,k)$ of fixed length $k$ given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n…