Related papers: On a partition problem of Canfield and Wilf
We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…
Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…
Unrefinable partitions are a subset of partitions into distinct parts which satisfy an additional unrefinability property. More precisely, being an unrefinable partition means that none of the parts can be written as the sum of smaller…
A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer…
Let $b^{k}_{\ell,m}(n)$ denotes the number of $k-$colored partitions of $n$ into parts that are not multiples of $\ell$ or $m$. We establish several congruence relations for $b_{\ell,m}(n)$. For instance, for any nonnegative integer $n$…
Let $M=(m_{i})_{i=0}^{\infty}$ be a sequence of integers such that $m_{0}=1$ and $m_{i}\geq 2$ for $i\geq 1$. In this paper we study $M$-ary partition polynomials $(p_{M}(n,t))_{n=0}^{\infty}$ defined as the coefficient in the following…
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
Let $X_1,\dots, X_n$ be independent integers distributed uniformly on $\{1,\dots, M\}$, $M=M(n)\to\infty$ however slow. A partition $S$ of $[n]$ into $\nu$ non-empty subsets $S_1,\dots, S_{\nu}$ is called perfect, if all $\nu$ values…
Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…
There exists a set $A$ of positive integers such that the number of representations of a large positive integer $m$ as a sum of two elements of $A$ grows with a lower bound of order $\log m$, but for which there is no subset $D$ of $A$…
Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…
In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…
Given a sequence $S=(s_1,\dots,s_m) \in [0, 1]^m$, a block $B$ of $S$ is a subsequence $B=(s_i,s_{i+1},\dots,s_j)$. The size $b$ of a block $B$ is the sum of its elements. It is proved in [1] that for each positive integer $n$, there is a…
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…
In recent work, Amdeberhan and Merca considered the integer partition function $a(n)$ which counts the number of integer partitions of weight $n$ wherein even parts come in only one color (i.e., they are monochromatic), while the odd parts…
We visualize the identity p(n) = sum s(k) p(n-k)/n for the integer partition function p(n) involving the divisor function s, add comments on the history of visualizations of numbers, illustrate how different mathematical fields play…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…
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…
We consider some $q$-series which depend on a pair of positive integers $(k,m)$. While positivity of these series holds for the first few values of $(k,m)$, the situation is quite unclear for other values of $(k,m)$. In addition, our series…