Related papers: Do perfect powers repel partition numbers?

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

Let $P$ be a polynomial with integer coefficients and degree at least two. We prove an upper bound on the number of integer solutions $n\leq N$ to $n! = P(x)$ which yields a power saving over the trivial bound. In particular, this applies…

In this paper we prove two results. The first theorem uses a paper of Kim \cite{K} to show that for fixed primes $p_1,...,p_k$, and for fixed integers $m_1,...,m_k$, with $p_i\not|m_i$, the numbers $(e_{p_1}(n),...,e_{p_k}(n))$ are…

The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…

If $\gcd(r,t)=1$, then a theorem of Alladi offers the M\"obius sum identity $$-\sum_{\substack{ n \geq 2 \\ p_{\rm{min}}(n) \equiv r \pmod{t}}} \mu(n)n^{-1}= \frac{1}{\varphi(t)}. $$ Here $p_{\rm{min}}(n)$ is the smallest prime divisor of…

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

Let $\lambda$ be a partition of the positive integer $n$ chosen umiformly at random among all such partitions. Let $L_n=L_n(\lambda)$ and $M_n=M_n(\lambda)$ be the largest part size and its multiplicity, respectively. For large $n$, we…

In this paper we deal with the problem of computing the sum of the $k$-th powers of all the elements of the matrix ring $\mathbb{M}_d(R)$ with $d>1$ and $R$ a finite commutative ring. We completely solve the problem in the case…

In the number partitioning problem (NPP) one aims to partition a given set of $N$ real numbers into two subsets with approximately equal sum. The NPP is a well-studied optimization problem and is famous for possessing a…

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…

For primes $p$, we study the maximal possible size of a $p$-core $p'$-partition (a partition with no hook lengths or parts divisible by $p$). McDowell recently proved that the maximum is attained by a unique partition, say $\Lambda_p$.…

We prove that for every integer $d \ge 2$ there exists a dense collection of subsets of $[n]^d$ such that no two of them have a symmetric difference that may be written as the $d$th power of a union of at most $\lfloor d/2 \rfloor$…

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

Let $p(n)$ be the partition function. Ahlgren and Ono conjectured that every arithmetic progression contains infinitely many integers $N$ for which $p(N)$ is not congruent to $0\pmod{3}$. Radu proved this conjecture in 2010 using work of…

Let $p_{k,3}(n)$ enumerate the number of 2-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $k$. In this paper, we prove several infinite families of congruences modulo powers of 3 for…