Related papers: Power Partitions
We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…
We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.
We prove infinitely many congruences modulo 3, 5, and powers of 2 for the overpartition function $\bar{p}(n)$ and two smallest parts functions: $\bar{\operatorname{spt1}}(n)$ for overpartitions and $\operatorname{M2spt}(n)$ for partitions…
We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…
In a note published in 1925, G. H. Hardy stated the inequality \begin{equation*} \sum_{n=1}^\infty \left(\frac{1}{n}\sum_{k=1}^n a_k \right)^p \leq \left(\frac{p}{p-1}\right)^p \sum_{n=1}^\infty a_n^p, \end{equation*} for any non-negative…
One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…
Recently, Debruyne and Tenenbaum proved asymptotic formulas for the number of partitions with parts in $\mathcal{L}\subset\mathbb{N}$ ($\gcd(\mathcal{L})=1$) and good analytic properties of the corresponding zeta function, generalizing work…
A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…
Ramanujan's 1920 last letter to Hardy contains seventeen examples of mock theta functions which he organized into three "orders." The most famous of these is the third-order function $f(q)$ which has received the most attention of any…
Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…
In this paper we obtain asymptotic formulas for the Fourier coefficients of an infinite family of crank generating functions. Moreover we use this result to show that the crank obeys certain inequalities. This implies that the crank can not…
Let $ a_1(x)p_1(x)^n + \cdots + a_k(x)p_k(x)^n $ as well as $ b_1(x)q_1(x)^m + \cdots + b_l(x) q_l(x)^m $ be two polynomial power sums where the complex polynomials $ p_i(x) $ and $ q_j(x) $ are all non-constant. Then in the present paper…
For fixed $m$ and $R\subseteq \{0,1,\ldots,m-1\}$, take $A$ to be the set of positive integers congruent modulo $m$ to one of the elements of $R$, and let $p_A(n)$ be the number of ways to write $n$ as a sum of elements of $A$. Nathanson…
In 2013 Zhi-Wei Sun conjectured that $p(n)$ is never a power of an integer when $n>1.$ We confirm this claim in many cases. We also observe that integral powers appear to repel the partition numbers. If $k>1$ and $\Delta_k(n)$ is the…
Recently, a novel method based on coding partitions [1]-[4] has been used to derive power series expansions to previously intractable problems. In this method the coefficients at $k$ are determined by summing the contributions made by each…
We describe a new model of massless thermal bosons which predicts an hyperbolic fluctuation spectrum at low frequencies. It is found that the partition function per mode is the Euler generating function for unrestricted partitions $p(n)$.…
We prove almost sure strong asymptotic freeness of i.i.d. random unitaries with the following law: sample a Haar unitary matrix of dimension $n$ and then send this unitary into an irreducible representation of $U(n)$. The strong convergence…
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…