Related papers: Nuclear partitions and a formula for $p(n)$

For $n \in \mathbb{N}$ let $\Pi[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing…

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.

We study the generating function of the excess number of Rogers-Ramanujan partitions with odd rank over those with even rank, and, using combinatorial and analytical techniques, show that this generating function is closely connected with…

Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…

We show that while the number of coprime compositions of a positive integer $n$ into $k$ parts can be expressed as a $\mathbb{Q}$-linear combinations of the Jordan totient functions, this is never possible for the coprime partitions of $n$…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

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…

In this note, we provide a simple derivation of expressions for the restricted partition function and its polynomial part. Our proof relies on elementary algebra on rational functions and a lemma that expresses the polynomial part as an…

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

Let $A_{t,k}(n)$ denote the number of partition $k$-tuples of $n$ where each partition is $t$-core. In this paper, we establish formulas of $A_{t,k}(n)$ for some values of $t$ and $k$ by employing the method of modular forms, which extends…

Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…

In 1917, Hardy and Ramanujan obtained the asymptotic formula for the classical partition function $p(n)$. The classical partition function $p(n)$ has been extensively studied. Recently, Luca and Ralaivaosaona obtained the asymptotic formula…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…