Related papers: Partition-theoretic formulas for arithmetic densit…

In 1977, the first author observed a duality between the largest and smallest prime factors of integers, and established as a consequence some new results on the M\"obius function $\mu(n)$ using the Prime Number Theorem for Arithmetic…

Assume $\mathsf{M}_n$ is the $n$-dimensional permutation module for the symmetric group $\mathsf{S}_n$, and let $\mathsf{M}_n^{\otimes k}$ be its $k$-fold tensor power. The partition algebra $\mathsf{P}_k(n)$ maps surjectively onto the…

We estimate the asymptotic density of the set $\bar{A}$ of primes $p$ satisfying the constraint that $p+1$ and $p-1$ have only one prime divisor larger than $3$. We also estimate the density of a maximal subset $\bar{B} \subset \bar{A}$…

Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured…

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

The ratio set of a set of positive integers $A$ is defined as $R(A) := \{a / b : a, b \in A\}$. The study of the denseness of $R(A)$ in the set of positive real numbers is a classical topic and, more recently, the denseness in the set of…

Let A and M be nonempty sets of positive integers. A partition of the positive integer n with parts in A and multiplicities in M is a representation of n in the form n = \sum_{a\in A} m_a a, where m_a is in M U {0} for all a in A, and m_a…

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

Let $\ell\ge5$ be an odd prime and $j, s$ be positive integers. We study the distribution of the coefficients of integer and half-integral weight modular forms modulo odd positive integer $M$. As a consequence, we prove that for each…

The use of realistic input models has gained popularity in the theory community. Assuming a realistic input model often precludes complicated hypothetical inputs, and the analysis yields bounds that better reflect the behaviour of…

Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…

We present a new FPTAS for the Subset Sum Ratio problem, which, given a set of integers, asks for two disjoint subsets such that the ratio of their sums is as close to $1$ as possible. Our scheme makes use of exact and approximate…

Let $(F_n)$ be the sequence of Fibonacci numbers and, for each positive integer $k$, let $\mathcal{P}_k$ be the set of primes $p$ such that $\gcd(p - 1, F_{p - 1}) = k$. We prove that the relative density $\text{r}(\mathcal{P}_k)$ of…

We describe how the Hardy-Ramanujan-Rademacher formula can be implemented to allow the partition function $p(n)$ to be computed with softly optimal complexity $O(n^{1/2+o(1)})$ and very little overhead. A new implementation based on these…

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Given positive measures $\nu,\mu$ on an arbitrary measurable space $(\Omega, \mathcal F)$, we construct a sequence of finite partitions $(\pi_n)_n$ of $(\Omega, \mathcal F)$ s.t. $$ \sum_{A\in \pi_n: \mu(A)>0} 1_{A} \frac{\nu(A)}{\mu(A)}…

The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…

Let $p(n)$ denote the partition function and define $p(n,k)=\sum_{j=0}^{k}\binom{n-j}{k-j}p(j)$ where $p(0)=1$. We prove that $p(n,k)$ is unimodal and satisfies $p(n,k) < \frac{2.825}{\sqrt{n}}\, 2^n $ for fixed $n\ge 1$ and all $1\le k\le…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…