Submitted works

Advanced search

math.CO — Combinatorics

An Upper Bound Exponent of 0.9999873 for Square-Difference-Free Sets

Contributed by Eric Naslund

Let A⊆{1,…,N}A\subseteq\{1,\ldots,N\} contain no two distinct elements whose difference is a nonzero square, and let s(N)s(N) be the largest possible size of such a set. We prove \[ s(N)\le CN^{0.9999873} \] with an absolute constant CC. A recent preprint of OpenAI proves $s(N)\le CN^{1-\eps}$ for some absolute $\eps>0$. Their proof utilizes a certain average of the Fourier transform over (24!)161(24!)^{161} points, and for the parameter choices displayed there we calculate that they obtained $\eps\approx \exp_{10}(-\exp_{10}(\exp_{10}(5782.77)))$, in the sense that $\log_{10}\log_{10}\log_{10}(1/\eps)\approx5782.77$. We follow the same overall strategy, with new work at almost every quantitative step. The largest gain is the use of 7272 slots (positions at which the Fourier transform is evaluated) in place of (24!)161(24!)^{161}: the exponent is roughly a fixed constant divided by the number of slots, so this alone gains many orders of magnitude, but leaves far less room for loss elsewhere. Other savings come from the local construction at each prime. Small primes are handled jointly rather than one by one; and errors are measured in the actual half-distributions of the laws being compared, not bounded term by term against a product model. Where sums over the primes of a block of Weil-type error terms of size O(p−1/2)O(p^{-1/2}) would be too weak, we prove bounds of order O(p−1)O(p^{-1}) for the same error terms using \'etale cohomology over finite fields (Deligne's theorems and Katz--Sarnak monodromy for families of curves), the representation theory of GL2(Fp)\mathrm{GL}_2(\mathbf F_p), exact counts at p≡3(mod4)p\equiv3\pmod4, and a modular evaluation of Ahlgren and Ono. Dependence in our distributions is controlled by the correlation inequalities of Peyre and Kassabov. The remaining finitely many numerical inequalities are verified by exact computer arithmetic, listed in the appendices; all analytic steps are proved in the text. The companion repository \cite{NaslundUpperRepository2026} contains a partial Lean 4 formalization, totaling over 600,000 lines of lean. It establishes s(N)≤CN0.99999s(N)\le C N^{0.99999}, conditional on five named analytic inputs and explicit numerical hypotheses. This formalizes the most critical parts of the proof.

Primarily AI-generated textHuman understanding: some parts
Nov 13, 2026603 pages
PDFView work

math.CO — Combinatorics

Square-difference-free sets of exponent 0.7580758

Contributed by Eric Naslund

Let D(N)D(N) be the largest cardinality of a subset of {1,…,N}\{1,\ldots,N\} containing no two elements whose difference is a nonzero perfect square. We give a computer-assisted construction proving D(N)≥N0.7580758318008816−o(1)D(N)\ge N^{0.7580758318008816-o(1)}, improving the exponent 0.752796455874514…0.752796455874514\ldots of Krachun's ranked-block construction. The residues we use carry subintervals of [0,1][0,1] that are ordered along every modular square difference. A finite stopping-word argument shows that if finitely many such alphabets, in pairwise coprime perfect-square moduli, have interval moments whose contributions sum to more than α\alpha, then α\alpha is an attainable exponent. Krachun's prime chains reproduce his exponent in this framework. The gain comes from an alphabet modulo a power of 44, built by a 2525-state recursion, and from two composite alphabets, at the primes 5,435,43 and at 19,2319,23, in which the first differing digit is read separately at each prime. The numerical conclusion is computer-assisted. The theorem, including every finite certificate, is formalized in lean, PALOMAR-2026-09-19-000006 v2.

Primarily AI-generated textHuman understanding: some parts
Oct 08, 202626 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

math.CO — Combinatorics

An Exponent of 1.043 for the Unit Distance Problem

Contributed by Eric Naslund

Let u(U)u(U) count the unordered pairs at distance one in a finite planar set UU. We construct finite sets UjU_j with ∣Uj∣→∞|U_j|\to\infty and u(Uj)/∣Uj∣1.043171→∞u(U_j)/|U_j|^{1.043171}\to\infty. The largest exponent previously claimed, apart from preliminary versions of the present work, is 1.03581.0358, in the author's unpublished manuscript. The method is the number-field construction of OpenAI and Sawin. Here unit distances come from elements of relative norm one in quadratic extensions K/FK/F in which FF has both real and complex places, and the fields come from an infinite pro-22 tower over $\Q(\sqrt{241})$, ramified only above 22, 33 and 55, with Frobenius conditions at the two primes above 2929 and at one prime above 4141. The relative zeta value is bounded through the dihedral quotients of the tower group: the tower group has 2727 quotients isomorphic to the dihedral group of order~88; fifteen of them detect, by a census, the residue degree of the primes that split completely in the Kummer field up to norm 4⋅10134\cdot10^{13}, and seven of them generate a field EW′′E_{W''} of degree 81928192 contained in every field of the tower. We write ζEW′′\zeta_{E_{W''}} as a product of LL-functions of degrees 22, 44 and~88, evaluate the 576576 of degrees 44 and 88 rigorously at 2121 real points near~11, and combine the values through a kernel inequality with coefficients of both signs. Finite facts and numerical inequalities are certified by exact computation and interval arithmetic. Partial formalization PALOMAR-2026-10-01-000018 v2

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