Searcharxiv⌕ Search

arXiv · 2611.08717

Composite witness sieves, Kneser--Plancherel containers, and the exponent $5/7$ for the Erdős--Straus conjecture

Abstract

For the Erdős--Straus equation $4/n=1/x+1/y+1/z$, Vaughan's unconditional bound on the exceptional set $E(N)$ has stood at $|E(N)|\ll N\exp(-c(\log N)^{2/3})$ since 1970. We harness composite divisor witnesses at growing depth to cross this $2/3$ barrier unconditionally. On the full exceptional set $E(N)$, we prove the unconditional bound $|E(N)|\ll N\exp(-c'(\log N)^{5/7}/(\log\log N)^{2/7})$, improving the exponent to $5/7$ (with an intermediate stage at $7/10$). On the structured component $E_2^{\mathrm{small}}(N;J(N))$, an algebraic and spectral container hierarchy combined with a generating-polynomial large sieve reaches the exponent $1-o(1)$: $|E_2^{\mathrm{small}}(N;J(N))|\ll_κN\exp(-(\frac{1}{40960}+o(1))\frac{\log N}{(\log\log N)(\log\log\log N)^κ})$, matching the CRT capacity scale. These results resolve the obstructions to composite-witness sieving at growing depth. First, we replace subgroup generation by Kneser's stabilizer $K(M)$, which embeds into a $2$-primary character kernel, reducing container counts from $2^{Θ(J^{4})}$ to $\exp(\mathcal{O}(J^{2}\log\log J))$. Coupling this with a generating-polynomial large sieve, Markov $1/2$-popular symmetry containers, and Pontryagin--Plancherel character containers yields the exponent $1-o(1)$ on $E_2^{\mathrm{small}}$. Second, to bypass unlocalized diffuse divisor sheets without subset enumeration, we construct a semi-composite congruence sieve $s=pq\equiv-1\pmod{12ua}$ ($p\in(Z^{9/10},Z]$, $q\le Q$ rough). Conditioning on $n\bmod M_{\mathrm{small}}$ yields CRT mutual independence while decoupling the modulus $12ua\le 12Z^{1/4}$ from $q$; a Bonferroni majorant and the Bombieri--Vinogradov theorem then yield the unconditional $5/7$ exponent on all of $E(N)$. Finally, we study bilinear dispersion on $4uavw-4u^{2}v-w=n$ and difference sets $D(K_c)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Benjamin Dahan. 2026-11-05. Composite witness sieves, Kneser--Plancherel containers, and the exponent $5/7$ for the Erdős--Straus conjecture. https://arxiv.org/abs/2611.08717

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Qin's Algorithm, Continued Fractions and 2-dimensional Lattices

In his ``Mathematical Treatise in Nine Sections''(1247), Jiushao Qin introduced ``the Dayan method of deriving unity'' for computing modular inverses, an essential component of his treatment of the Chinese remainder theorem. A distinctive feature of Qin's algorithm is its use of a state consisting of four nonnegative integers arranged in a matrix. In this paper, we investigate the mathematical structure of these states and their connections with continued fractions and two-dimensional lattices. By introducing a signed version of the state, we obtain a natural matrix representation that reveals the convergents of continued fractions and gives direct derivations of several classical results. We then show that the signed states form bases of a family of two-dimensional lattices arising from modular congruences. In particular, we prove that a shortest lattice vector can be obtained from the rows of a signed state or their sum or difference. We also study the monotonicity of the inner products of the state vectors and discuss a subsequent result that locates a shortest vector in one of two consecutive states. It is surprising that a shortest lattice vector is found in a highly structure sequence of states. These results demonstrate that the state structure of Qin's algorithm provides a unified framework for understanding modular inversion, continued fractions, and shortest vectors in two-dimensional lattices.

math.NT↗

The symmetrized sum of finite $q$-multiple harmonic sums with one exceptional index

In this paper, we give explicit expressions for $q$-harmonic sums on $1-\cdots-1,A,1-\cdots-1$ indices. The case $A=1$ has been extensively studied, and a variety of identities, explicit evaluations, and structural properties are known. Likewise, numerous explicit evaluations are available for $q$-multiple zeta values and $q$-harmonic sums with uniform indices $A-\cdots-A$. Although several methods are available for treating non-uniform indices, explicit evaluations for the pattern $1-\cdots-1,A,1-\cdots-1$ remain comparatively scarce. The case $A=2$ was settled only recently. In this paper, we extend this framework to the general case $A\ge3$ as the total sum with the theory of the elementary symmetric functions, though we do not generally evaluate each summand at a prescribed position of $A$. We obtain explicit formulas in terms of binomial coefficients and degenerate Bernoulli numbers. Some expressions about $2-\cdots-2,A,2-\cdots-2$ are also shown.

math.NT↗