Related papers: The second shifted difference of partitions and it…

We present some Euler-type recurrences for the partition function $p(n)$.

In this paper, we show analytically that the duality of normal factor graphs (NFG) can facilitate stochastic estimation of partition functions. In particular, our analysis suggests that for the $q-$ary two-dimensional nearest-neighbor Potts…

We examine the value distributions of coefficients in certain $q$-series related to half Appell sums in higher-level and the first moment of the Garvan's $k$-rank of partitions. We prove that these coefficients equal certain restricted…

For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…

We introduce a new pair of mutually dual bases of noncommutative symmetric functions and quasi-symmetric functions, and use it to derive generalizations of several results on the reduced incidence algebra of the lattice of noncrossing…

We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…

In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

Let $\mathbf a=(a_1,\ldots,a_r)$ be a sequence of positive integers and $k\geq 2$ an integer. We study $p_{k,\mathbf a}(n)$, the restricted $k$-multipartition function associated to $\mathbf a$ and $k$. We prove new formulas for…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

Let $\mathfrak{p}_{\mathbb{P}_r}(n)$ denote the number of partitions of $n$ into $r$-full primes. We use the Hardy-Littlewood circle method to find the asymptotic of $\mathfrak{p}_{\mathbb{P}_r}(n)$ as $n \to \infty$. This extends previous…

Second-order variational properties have been shown to play important theoretical and numerical roles for different classes of optimization problems. Among such properties, twice epi-differentiability has a special place because of its…

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.

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…

We deduce from the strong form of the Hardy--Ramanujan asymptotics for the partition function $p(n)$ an asymptotics for $p_{-S}(n)$, the number of partitions of $n$ that do not use parts from a finite set $S$ of positive integers. We apply…

Let $p_2(n)$ denote the number of cubic partitions. In this paper, we shall present two new congruences modulo $11$ for $p_2(n)$. We also provide an elementary alternative proof of a congruence established by Chan. Furthermore, we will…

Extending the partition function multiplicatively to a function on partitions, we show that it has a unique maximum at an explicitly given partition for any $n\neq 7$. The basis for this is an inequality for the partition function which…

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…

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…

Lin introduced the partition function $\text{PDO}_t(n)$, which counts the total number of tagged parts over all the partitions of $n$ with designated summands in which all parts are odd. For $k\geq0$, Lin conjectured congruences for…