Related papers: When Does the Set of $(a, b, c)$-Core Partitions H…
We improve some results on the size of the greatest prime factor of integers of the form ab+1, where a and b belong to finite sets of integers with rather large density.
A triple of positive integers (d,h,m) is admissible if for any m given masses in R^d there exist h hyperplanes that cut each of these masses into 2^h equal pieces. We present an elementary reduction which combined with results by Ramos…
We consider simultaneous $(s,s+t,s+2t,\dots,s+pt)$-core partitions in the large-$p$ limit, or (when $s<t$), partitions in which no hook may be of length $s \pmod{t}$. We study generating functions, containment properties, and congruences…
We observe that for a and b relatively prime, the "abacus construction" identifies the set of simultaneous (a,b)-core partitions with lattice points in a rational simplex. Furthermore, many statistics on (a,b)-cores are piecewise polynomial…
By an $abc$ triple, we mean a triple $(a,b,c)$ of relatively prime positive integers $a,b,$ and $c$ such that $a+b=c$ and $\operatorname{rad}(abc)<c$, where $\operatorname{rad}(n)$ denotes the product of the distinct prime factors of $n$.…
Tewodros Amdeberhan and Armin Straub initiated the study of enumerating subfamilies of the set of (s,t)-core partitions. While the enumeration of (n+1,n+2)-core partitions into distinct parts is relatively easy (in fact it equals the…
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of…
A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…
In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…
In 1995, Stiebitz asked the following question: For any positive integers $s,t$, is there a finite integer $f(s,t)$ such that every digraph $D$ with minimum out-degree at least $f(s,t)$ admits a bipartition $(A, B)$ such that $A$ induces a…
The abc conjecture, one of the most famous open problems in number theory, claims that three positive integers satisfying a+b=c cannot simultaneously have significant repetition among their prime factors; in particular, the product of the…
Let $S$ be a $*$-monoid and let $a,b,c$ be elements of $S$. We say that $a$ is $(b,c)$-core-EP invertible if there exist some $x$ in $S$ and some nonnegative integer $k$ such that $cax(ca)^{k}c=(ca)^{k}c$, $x{\mathcal R}(ca)^{k}b$ and…
If $a>b$ and $n>1$ are positive integers and $a$ and $b$ are relatively prime integers, then a large Zsigmondy prime for $(a,b,n)$ is a prime $p$ such that $p \,|\, a^n-b^n$ but $p \,\nmid \, a^m-b^m$ for $1 \leq m < n$ and either $p^2 \, |…
We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z <A>, with S = S_0 + S_1,…
In a previous paper (arXiv:1608.02262), we used computer-assisted methods to find explicit expressions for the moments of the size of a uniform random (n,n+1)-core partition with distinct parts. In particular, we conjectured that the…
Armstrong, Hanusa and Jones conjectured that if $s,t$ are coprime integers, then the average size of an $(s,t)$-core partition and the average size of a self-conjugate $(s,t)$-core partition are both equal to $\frac{(s+t+1)(s-1)(t-1)}{24}$.…
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…
Motivated by a recent paper of Straub, we study the distribution of integer partitions according to the length of their largest hook, instead of the usual statistic, namely the size of the partitions. We refine Straub's analogue of Euler's…
In this paper we first investigate for what positive integers $a,b,c$ every nonnegative integer $n$ can be represented as $x(ax+1)+y(by+1)+z(cz+1)$ with $x,y,z$ integers. We show that $(a,b,c)$ can be either of the following seven triples:…
Recently, Deutsch and Elizalde studied the largest and the smallest fixed points of permutations. Motivated by their work, we consider the analogous problems in set partitions. Let $A_{n,k}$ denote the number of partitions of $\{1,2,\dots,…