Related papers: Exact Formulae for the Fractional Partition Functi…

In his book Topics in Analytic Number Theory, Rademacher considered the generating function of partitions into at most $N$ parts, and conjectured certain limits for the coefficients of its partial fraction decomposition. We carry out an…

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…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

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 a recent paper, Bacher and de la Harpe study the conjugacy growth series of finitary permutation groups. In the course of studying the coefficients of a series related to the finitary alternating group, they introduce generalized…

Ramanujan gave a recurrence relation for the partition function in terms of the sum of the divisor function $\sigma(n)$. In 1885, J.W. Glaisher considered seven divisor sums closely related to the sum of the divisors function. We develop a…

Let $\kappa$ be a positive real number and $m\in\mathbb{N}\cup\{\infty\}$ be given. Let $p_{\kappa, m}(n)$ denote the number of partitions of $n$ into the parts from the Piatestki-Shapiro sequence $(\lfloor \ell^{\kappa}\rfloor)_{\ell\in…

Let $\mathbb{P}$ denote the set of primes and $\mathcal{N}\subset \mathbb{N}$ be a set with arbitrary weights attached to its elements. Set $\mathfrak{p}_{\mathcal{N}}(n)$ to be the restricted partition function which counts partitions of…

We establish the average-case hardness of the algorithmic problem of exact computation of the partition function associated with the Sherrington-Kirkpatrick model of spin glasses with Gaussian couplings and random external field. In…

We introduce novel results for approximate inference on planar graphical models using the loop calculus framework. The loop calculus (Chertkov and Chernyak, 2006) allows to express the exact partition function of a graphical model as a…

Let $f \in \mathbb{Z}[y]$ be a polynomial such that $f(\mathbb{N}) \subseteq \mathbb{N}$, and let $p_{\mathcal{A}_{f}}(n)$ denote number of partitions of $n$ whose parts lie in the set $\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}$. Under…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

Feynman and Hibbs were the first to variationally determine an effective potential whose associated classical canonical ensemble approximates the exact quantum partition function. We examine the existence of a map between the local…

The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

We examine "partition zeta functions" analogous to the Riemann zeta function but summed over subsets of integer partitions. We prove an explicit formula for a family of partition zeta functions already shown to have nice properties -- those…

The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

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…