We prove that for every integer $N\geq2$, there exist positive integers $a$ and $b$ such that $N=a+b$ and $\Omega(ab)\leq33$, where $\Omega(n)$ denotes the number of prime factors of $n$, counted with multiplicity. This improves the previous bound of $40$ obtained by Dudek and Dunn. The proof applies the explicit Friedlander--Iwaniec $\Lambda^-\Lambda^2$ lower-bound sieve to a sequence derived from the products $n(N-n)$. The main new ingredient is pre-sieving at the prime $3$, which eliminates the extremal small-prime case in the dimension condition while keeping the resulting remainder terms under explicit control. We complete the proof using analytic estimates for large $N$, finite verification over an intermediate range, and explicit prime-gap data for small $N$.
We show that for every fixed $\varepsilon>0$, there exist arbitrarily large families of point-line pairs $(x_1,\ell_1),\ldots,(x_n,\ell_n)$ in $[0,1]^2$, with $x_i \in \ell_i$ for all $i$, and such that $\operatorname{dist}(x_i,\ell_j)\ge n^{-2/3-\varepsilon}$ for all $i \neq j$. Combined with a previous result of Cohen, the author, and Zakharov, this solves the minimal distance problem. The same construction also comes with an unexpected finite field consequence: for every $\varepsilon>0$, there exists a set of primes $q$ of positive relative density for which $\mathbb F_q^2$ contains an induced point-line matching of size $\gtrsim q^{3/2-\varepsilon}$. This disproves a conjecture of Hunter, the author, Verstra\"ete and Zhang.
A positive $D(n)$-$m$-tuple is a set $A=\{a_1,\ldots,a_m\}$ of distinct positive integers such that $a_i a_j+n$ is a square for every $i\ne j$. In 2005, Dujella and Luca obtained an absolute bound for the cardinality of a $D(p)$- or $D(-p)$-tuple of positive integers, uniformly in the prime $p$. We extend the underlying gap argument to prime powers. An explicit toric elimination certificate, proved by elementary linear algebra, replaces the unsaturated homogeneous elimination step and is valid modulo every prime power. Explicit degree and height bounds for this eliminant yield a uniform gap principle. Combined with the general bound for bounded $|n|$, this shows that every positive reduced $D(\pm p^r)$-tuple (i.e. tuple with elements not divisible by $p$) has less than $2^{121}$ elements, independently of $p$ and $r$. Thus, every positive $D(\pm p)$-tuple has at most $2^{121}$ elements, positive $D(\pm p^2)$-tuples have less than $2^{122}$ elements, and the maximal cardinality of a positive $D(\pm p^r)$-tuple is $O(r)$ uniformly in $p$.
Let $S_k(\alpha;K)$ denote the exponential sum over $k$-free integers in the short interval $(N-K,N]$. For $s>0$, we prove essentially tight bounds on the $s$-th moments of $S_k(\alpha;K)$ whenever $K \gg N^{\theta_{k,s}+\epsilon}$ for some $\theta_{k,s}<1/2$. As an immediate consequence, we obtain a lower bound for the $L^1$-mean of the M\"obius-twisted exponential sum over short intervals of length at least $N^{0.49685}$. Moreover, we show that further improvements on all of these results would follow immediately from improvements to an $\ell^2$-estimate involving the M\"obius function.
For coprime $a+b=c$, the parity class in which $a$ and $b$ are odd and $c$ is even admits an exact treatment. Triples are measured by the radical excess $E_{\varepsilon}=\log c-(1+\varepsilon)\log\operatorname{rad}(abc)$, and called transgressive at fixed $\varepsilon>0$ when it is non-negative. The $abc$ conjecture asserts that such triples are finite in number. The excess is written exactly in terms of the defect, the mass of repeated primes the radical discards, and rearranges into a linear threshold in which the smaller summand $s=\min\{a,b\}$ appears explicitly. Either $s$ stays bounded along a subsequence, or the defect must overshoot the threshold and rejoin it at an amplified exponent. For the Mersenne family $\mathcal{V}_m = (1, 2^m-1, 2^m)$ transgression at $\varepsilon=0$ holds precisely when $2^m-1$ fails to be squarefree, on a set of exponents of density $47/210$. The defect obeys the exact law $\Delta_m = \Omega_m + \log G_m$, where $\Omega_m$ collects the Wieferich primes dividing $2^m-1$ and $G_m$ is the largest divisor of $m$ whose prime factors divide $2^m-1$. This divisor is trivial on prime-power exponents and largest on $m_k = \operatorname{lcm}(1,\dots,k)$, where the margin $q(\mathcal{V}_{m_k}) - 1 \geq (1-o(1))\log m_k / (m_k\log 2)$ is the most any Wieferich-free mechanism can give. An $abc$ counterexample family along the Mersenne line would require infinitely many Wieferich primes with exponential order--defect growth. A final section separates two elliptic curves attached to the class: the Frey curve, whose minimal discriminant expresses the total defect with a bounded correction at $2$, and a congruent-number Jacobian, whose Szpiro quotient stays below $3$.
For $m\geq 2$, let $c_p(m)$ be the all-dimensional best constant in $$ \left\|\sum_{k=1}^m A_k\right\|_p \leq c_p(m)\left\|\sum_{k=1}^m |A_k|\right\|_p. $$ Tang and Zhang conjectured an explicit formula for every finite $p>1$. We disprove the conjecture with two explicit real $2\times 2$ rank-one matrices at $p=3/2$. The comparison is certified by seven strict rational inequalities and, in particular, places the attained ratio above $207/200$, while the conjectured constant lies below $207/200$. On the positive side, we prove the conjectured sharp bound for every family of rank-at-most-one summands when $2\leq p<\infty$, and classify all equality cases. We also prove the corresponding endpoint statement for $p=\infty$. Finally, for arbitrary complex matrices, we establish the conjectured sharp constant in the case $m=2$, $p=4$.
We provide an explicit algebraic construction showing that, uniformly for integers $3 \leq s \leq t$, as $t \to \infty$, \[ R( s,t ) \geq t^{(1-o(1)) \log s / \log(\log s + 1) }. \] For large fixed $s$, this improves the dependence on $s$ in the general off-diagonal construction of Alon and Pudl\'ak. In particular, $R(33, t) \geq t^{2.1-o(1)}$, to our knowledge, the first explicit construction showing $R(s, t) \geq t^c$ for some fixed $s$ and some $c>2$. In the diagonal case, it improves the leading constant in the exponent of the classical Frankl--Wilson bound from $1/4$ to $1$, while being almost as simple to describe.
F. Ihringer, Sam Mattheus· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
