Related papers: Asymptotic formulas for general colored partition …

Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K.…

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Let $\ell \geq 5$ be prime. For the partition function $p(n)$ and $5 \leq \ell \leq 31$, Atkin found a number of examples of primes $Q \geq 5$ such that there exist congruences of the form $p(\ell Q^{3} n+\beta) \equiv 0 \pmod{\ell}.$…

Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's "Lost" Notebook, there are several formulas involving this function, but they are not as simple as the identities with other similar shape of functions.…

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Fix positive integers $p$ and $q$ with $2 \leq q \leq {p \choose 2}$. An edge-coloring of the complete graph $K_n$ is said to be a $(p, q)$-coloring if every $K_p$ receives at least $q$ different colors. The function $f(n, p, q)$ is the…

We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler…

Let $\overline{p}(n)$ denote the overpartition function. Liu and Zhang showed that $\overline{p}(a) \overline{p}(b)>\overline{p}(a+b)$ for all integers $a,b>1$ by using an analytic result of Engle. We offer in this paper a combinatorial…

In this paper, we give explicit error bounds for the asymptotic expansion of the shifted distinct partition function $q(n +s)$ for any nonnegative integer $s$. Then based on this refined asymptotic formula, we give the exact thresholds of…

We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.

Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…

The 2-color partitions may be considered as an extension of regular partitions of a natural number $n$, with $p_{k}(n)$ defined as the number of 2-colored partitions of $n$ where one of the 2 colors appears only in parts that are multiples…

In this short note, we prove equidistribution results regarding three families of three-colour partitions recently introduced by Schlosser and Zhou. To do so, we prove an asymptotic formula for the infinite product $F_{a,c}(\zeta ; {\rm…

A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…

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,…

For a vector $\mathbf a=(a_1,\ldots,a_r)$ of positive integers we prove formulas for the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0,…

Biases in integer partitions have been studied recently. For three disjoint subsets $R,S,I$ of positive integers, let $p_{RSI}(n)$ be the number of partitions of $n$ with parts from $R\cup S\cup I$ and $p_{R>S,I}(n)$ be the number of such…