Matching works

4 works

math.NT — Number Theory

A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734

Contributed by David Niedbala Giraudin

Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.

Primarily AI-generated textHuman understanding: no partsMaynard-Tao sieveadmissible tuplesbounded gapscomputer-assisted proofgaps between primes
Nov 16, 20263 pages
PDFView work

math.NT — Number Theory

Finite prime gaps from weighted Selberg sieves and pair penalties

Contributed by Annanay Kapila

Let Hm=lim inf⁡n→∞(pn+m−pn)H_m=\liminf_{n\to\infty}(p_{n+m}-p_n). We develop a pair-penalty refinement of a multidimensional Selberg sieve, together with explicit admissible tuples and interval-arithmetic evaluations. A mixed prime–divisor asymptotic is derived from distribution on triply densely divisible moduli. Combining it with the numerical certificates gives H2≤19,844H_2\le19{,}844, H3≤1,357,780H_3\le1{,}357{,}780, H4≤82,234,788H_4\le82{,}234{,}788, and H5≤4,830,355,416H_5\le4{,}830{,}355{,}416. The proof combines truncated marginal estimates, support-loss bounds for signed trial functions, a trace-preserving auxiliary sieve for prime pairs, and exact modular certificates. Exact finite data, interval enclosures, and reproducibility code accompany the manuscript.

Author comments: Updated manuscript dated 6 November 2026, with a pair-penalty refinement and improved bounds for H_2 through H_5.

Primarily AI-generated textHuman understanding: some parts
Oct 20, 202635 pages
PDFView work

math.NT — Number Theory

Note on variable role-reversals

Contributed by Runbo Li

In [1], the author uses variable role-reversals only when θ<4589−ε\theta < \frac{45}{89} - \varepsilon. In this note, we shall discuss how to use variable role-reversals when 4589−ε⩽θ<1120−ε\frac{45}{89} - \varepsilon \leqslant \theta < \frac{11}{20} - \varepsilon.

Primarily human-written textHuman understanding: all partsHarman's sieveVariable role-reversalsarithmetic progressionssieve methods
Oct 20, 20264 pages
PDFView work

math.NT — Number Theory

Linnik's constant is at most 3.993.99

Contributed by Eric Naslund

Let P(a,q)P(a,q) denote the least prime congruent to aa modulo qq, where (a,q)=1(a,q)=1. We give a computer-assisted proof that P(a,q)≪q3.99P(a,q)\ll q^{3.99}, improving the exponent 55 of Xylouris. More precisely, P(a,q)<q3.99P(a,q)<q^{3.99} for every sufficiently large qq, uniformly in aa. The main new ingredient is a graded near-density estimate for zeros of Dirichlet LL-functions, a weighted form of Heath-Brown's Lemma~12.1 of the kind he asked for in 1992. We combine it with the zero-location estimates and far-density method of Heath-Brown and Xylouris. The second novelty is the scale of the case analysis. Heath-Brown and Xylouris closed their final case analyses with 1414 and 2121 main cases, each by a chain of inequalities evaluated in floating point. In this paper, with the help of advanced AI models, we can push this much further. The middle range of the first zero is divided into 44534453 root cases and 47884788 terminal cases, each closed by its own linear program. On 4,196,8794{,}196{,}879 threshold boxes these programs give 29,397,33629{,}397{,}336 linear relaxations, and exact integer certificates for all of them bound the normalized zero sum strictly below~11. Exceptional zeros and the remaining exterior range are treated separately. This case analysis is a kind of systematic brute force enabled by AI: an analysis of this size, with parameters tuned to each case, would be very laborious or nearly impossible to carry out by hand, and it lets the new estimate be applied separately in each case. The near-density lemma, certificate soundness, and a conditional passage from a certified case to a prime are formalized in Lean, assuming published analytic inputs and specified facts about zeros (PALOMAR-2026-10-01-000020 v1).

Primarily AI-generated textHuman understanding: some parts
Oct 02, 202680 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations