Skip to content
Preprint

Sieve dimension and search depth for the Erd\H{o}s-Straus conjecture, $n \equiv 1 \pmod{24}$

Aug 2026 · 0 citations · 28 references
Mathematics

Abstract

For primes $n\equiv1\pmod{24}$ we study how deep an explicit, factorization-free search for a decomposition of $4/n$ into three unit fractions has to go. Write $E_2(N;J)$ for the set of such primes $n\le N$ at which no witness of depth at most $J$ exists, in the sense of the two-parameter criterion of Theorem 3.9 with coprime parameters $u,a\le J$. We prove that for every fixed $J$ $$|E_2(N;J)| \ll_J \frac{N}{(\log N)^{1+\mathfrak{A}(J)/2}},$$ the exponent being the exact dimension of the covering on which the proof rests. The proof replaces the subgroup generated by the prime factors, an approach that breaks down as soon as $(\mathbb{Z}/4m)^{\times}$ has exponent greater than $2$, by a fixed-point-free involution, and is unconditional at every $J$. Second, we exhibit an unconditional obstruction. At the shift $c=7$ there are $\asymp N(\log N)^{-3/2}$ primes $n\le N$, $n\equiv1\pmod{24}$, at which both branches of the divisor criterion fail. The representation of $K_7=(n+7)/4$ by the principal form of discriminant $-7$ has to be primitive, so that the relevant input is the primitive-representation theorem of Fuchs, Hsu, Rickards, Schindler and Stange [25] rather than the classical results of Iwaniec; a fixed shift therefore cannot leave a finite residual set. Third, a factorization-free procedure decides the conjecture for all primes of an interval $[N,2N]$. Its Type II pass costs $\mathcal{O}(N(\log N)^{3})$ while its Type I pass costs $\Theta(N^{2})$, which locates the whole quadratic cost in the extraction of the divisors of $4u^{2}d+1$ and exhibits an asymmetry between the two halves of the Type I/Type II dichotomy. The conjecture itself remains open.

View source

Similar papers

Preprint Sep 2026

The Burr-Erd\H{o}s-Graham-S\'os conjecture for the seven-cycle

For a graph $H$, let $f(n,e,H)$ be the least number of colors in an edge-coloring of some $n$-vertex graph with at least $e$ edges in which every copy of $H$ is rainbow. Burr, Erd\H{o}s, Graham, and S\'os conjectured that $f(n,\lfloor n^2/4\rfloor+1,C_{2k+1})=(1/8+o(1))n^2$ for every fixed $k\ge3$, and Buci\'c, Chen, a...

Asad Shahab · 0 citations
Preprint Sep 2026

The Erd\H{o}s--Hajnal hypergraph Ramsey problem for $r_4(6,n)$

The Ramsey number $r_k(s,n)$ is the smallest integer $N$ such that every $N$-vertex $k$-graph contains either a copy of $K_s^{(k)}$ or an independent set of size $n$. Erd\H{o}s and Hajnal conjectured that for every fixed $s>k\ge 4$, one has $r_k(s,n)\ge \operatorname{twr}_{k-1}(\Omega(n))$. This conjecture was independ...

Long-Ma Du, Xin-Yu Hu, Rui-Long Liu et al. · 0 citations
Preprint Aug 2026

On a conjecture on the Kasami APN function: reductions, structure theorems, a proof for $k\bmod n\in\{1,2,n{-}2,n{-}1\}$, and exhaustive verification for $n\le 13$

We study Carlet's cyclic-additive conjecture for the Kasami almost perfect nonlinear (APN) function $F(x)=x^{4^k-2^k+1}$ on $GF(2^n)$, $\gcd(k,n)=1$: for the $2^{n-1}$-element set $\Delta=\{F(b)+F(b+1)+1: b\in GF(2^n)\}$ and all distinct nonzero $v_1,v_2\in GF(2^n)$, \[ \bigl|\{(x,y,z)\in\Delta^3 : v_1x+v_2y+(v_1+v_2)z...

G. Nagy, Attila Vajda · 0 citations
Preprint Sep 2026

A Resolution of the de Bruijn--Erd\H{o}s Consecutive-Gap Problem

Let $(x_n)_{n\geq1}$ be a sequence of distinct points on the unit circle. An $r$-span is the total length of $r$ consecutive gaps determined by the inserted points. Write $M_n^{(r)}$ and $m_n^{(r)}$ for the largest and smallest $r$-spans after the first $n$ insertions. We prove that there is an absolute constant $c>0$...

Samuel Korsky · 0 citations
Preprint Aug 2026

On the large-clique version of the Erd\H{o}s-S\'os theorem

For graphs $H$ and $F$, let $\operatorname{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $F$-free graph of order $n$. Motivated by the Erd\H{o}s-S\'{o}s theorem, Gerbner and Palmer and, independently, Zhao and Peng conjectured that for every tree $T$ of order $k$ and every $3\le r\le k-1,$ $$\operatornam...

Kun Cheng, Yu-Rui Tang · 0 citations
Preprint Sep 2026

Proof of Almkvist's conjecture on the unimodality of partition polynomials

For integers $r\ge2$ and $n\ge1$, let $$ F_{r,n}(q)=\prod_{k=1}^{n}\frac{1-q^{rk}}{1-q^k}. $$ The coefficient of $q^j$ in \(F_{r,n}(q)\) counts partitions of $j$ into parts at most $n$, each occurring at most $r-1$ times. Hughes proved that $F_{2,n}(q)=\prod_{k=1}^{n}(1+q^k)$ is unimodal for every $n\ge 1$. This result...

Jian-Xi Mao, Wen-Le Shi, Bao-Xuan Zhu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.