Browse

All works

Browse the Hexagon catalog.

Newest works

1351 works

math.DS — Dynamical Systems

Combinatorial periods of asymmetric billiard trajectories in the regular pentagon

Contributed by Peter Graham

We prove that every even integer other than 22, 1212, 1414 and 1818 is the combinatorial period, the number of bounces before repeating, of a periodic billiard trajectory in the regular pentagon that does not have five-fold rotational symmetry. Davis and Lelièvre conjectured this in 2018 and checked it up to period 40004000, and Kontorovich and Zhang proved it for almost every even number. As they explain, a theorem of Davis, Fuchs and Tabachnikov turns the question into one about vectors. Each vector (a+bφ,c+dφ)(a+b\varphi,c+d\varphi) obtained from (0,1)(0,1) by products of four explicit 2×22\times2 matrices, where φ\varphi is the golden ratio and a,b,c,da,b,c,d are integers, has the half-period ℓ=a+b+c+d\ell=a+b+c+d, and when a congruence modulo 55 holds it gives such a trajectory of period n=2ℓn=2\ell. Varying the power of one of the two triangular matrices in such a product gives half-periods in an arithmetic progression. We give 379379 of these progressions, which together contain every half-period ℓ≥2\ell\ge2 except nine values. Six of the nine come from explicit trajectories checked in exact arithmetic; the other three are halves of excluded periods. The covering argument is checked in Lean, assuming the cited theorem. Whether the four excluded periods occur is not treated. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24119275. Paper text license: CC BY 4.0. The published code and data are governed by the licenses in the tagged release. Release archive folders: lean, checks, data.

Primarily AI-generated textHuman understanding: some partsDavis–Fuchs–Tabachnikov theoremDavis–Lelièvre conjectureGolden Ratiobilliards in the regular pentagoncombinatorial periodperiodic billiard trajectories
Nov 21, 20267 pages
PDFView work

math.CO — Combinatorics

The seventh ternary density Hales–Jewett number

Contributed by Peter Graham

Let cn,3c_{n,3} be the largest size of a subset of {0,1,2}n\{0,1,2\}^n containing no combinatorial line, a triple obtained by varying a nonempty set of coordinates through the same letter while fixing the rest. We give a computer-assisted proof that c7,3=1302c_{7,3}=1302, confirming Polymath1's tentative conjecture and closing its bounds 1302≤c7,3≤13481302\leq c_{7,3}\leq1348, recorded by Tao in 2009 and O'Bryant in 2015. The witness realizes Polymath1's known lower bound. Three auxiliary SAT bounds, slicing and global alphabet symmetry give sixteen main slice obligations. Refutations of all nineteen formulas were accepted by FRAT-rs, and in a separate earlier production campaign by drat-trim's lrat-check. Formal verification applies to certificate checking: cake_lpr, verified in HOL4 and compiled with CakeML, accepted refutations of all nineteen formulas across two regeneration campaigns. The SAT encodings, cap induction, symmetry reduction, case cover and counting interpretation are justified by the written proof and separate executable checks; they are outside that formal verification.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23752609. Paper text license: CC BY 4.0. The published code and data are governed by the licenses in the tagged release. Release archive folders: checks, data.

Primarily AI-generated textHuman understanding: some partsA156989LRATSATcombinatorial linescomputer-assisted proofdensity Hales–Jewett
Nov 21, 20267 pages
PDFView work

math.CO — Combinatorics

A base-r simplex that is not Ehrhart positive

Contributed by Peter Graham

For integers r≥2r\ge2 and d≥1d\ge1, Solus's base-rr dd-simplex is the convex hull of the standard basis vectors of Rd\mathbb{R}^d and the point −(r−1)(1,r,…,rd−1)-(r-1)(1,r,\dots,r^{d-1}). Solus introduced these simplices through numeral systems, proved that their h∗h^*-polynomials are real-rooted, and observed that computations suggest they are also Ehrhart positive. Fu Liu recorded this as Solus's conjecture that every base-rr dd-simplex is Ehrhart positive, and Liu and Solus restated it for all r≥2r\ge2 and d≥1d\ge1. We show that the conjecture fails: the base-1414 55-simplex has Ehrhart polynomial \[ 1-\tfrac{268}{15}t+\tfrac{3955}{12}t^2+\tfrac{5833}{2}t^3+\tfrac{10343}{12}t^4+\tfrac{67228}{15}t^5, \] whose linear coefficient is negative. The proof is an explicit bijection between the lattice points of each dilate and pairs consisting of a residue modulo 14514^5 and a vector of nonnegative integers, which reduces the count to the distribution of one integer-valued height function over the 537,824537{,}824 residues. Lean checks the whole statement from the definition of the convex hull, including the finite height distribution, by kernel evaluation. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23875145. Paper text license: CC BY 4.0. The published code and data are governed by the licenses in the tagged release. Release archive folders: lean, checks.

Primarily AI-generated textHuman understanding: some partsEhrhart polynomialEhrhart positivitySolus's conjecturebase-r simplexh*-polynomiallattice simplex
Nov 21, 20266 pages
PDFView work

math.AP — Analysis of PDEs

On finite-time blow-up of the 2D inviscid Boussinesq equations

Contributed by Xi Chen, Hedong Hou, Haoling Xiang

We construct smooth odd periodic data for the 2D inviscid Boussinesq equations whose temperature gradient becomes unbounded at the origin in finite time. On an accelerating shear with inclination δ\delta, a wave amplifies its temperature gradient by a factor of at least exp⁡(c/δ)\exp(c/\sqrt\delta). At the first return of its vorticity to zero, the gradient points downwards with inclination asymptotic to δ/2\delta/2. We use the successive zeros of the leading wave vorticity to select return times on successively shorter intervals. An upper bound on the pressure Hessian permits correction of each periodic wave with both particle endpoints prescribed. A transverse Green function bounds the contribution of late forcing to the initial velocity by the inverse of the preceding amplification, yielding smooth initial data for the limiting solution.

Author comments: This version corresponds to https://doi.org/10.6084/m9.figshare.35081110 and https://doi.org/10.5281/zenodo.24409261

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 21, 202638 pages
PDFView work

math-ph — Mathematical Physics

Rational points on Baxter's curve and roots of unity in the eight-vertex model

Contributed by Shankar Sivarajan

The Boltzmann weights of the symmetric eight-vertex model with fixed invariants Δ\Delta and Γ\Gamma form a curve of genus one, the intersection of two quadrics in $\PP^3$. When Δ\Delta and Γ\Gamma are rational, this curve is an elliptic curve over $\Q$ with at least eight rational points and full rational 22-torsion, and the crossing parameter of Baxter's elliptic parametrization corresponds to a rational point on it. By Mazur's theorem, if this point is a torsion point (an elliptic root of unity), its order is 33, 44, 66, or 88. We give the loci of each exact order explicitly; over $\C$ they lie in finite-order conditions found by Boukraa and Maillard. Consequently the finite-order loci of orders 55, 77, 1010, 1212, and 2020 contain no rational nondegenerate (Δ,Γ)(\Delta,\Gamma), and the order-88 case, which occurs with rational weights, has no rational counterpart in the six-vertex limit. Away from these loci the crossing point has infinite order, so the curve has positive rank, and its multiples produce infinite families of commuting inhomogeneous transfer matrices with rational weights.

Primarily AI-generated textHuman understanding: all partsBaxter's curveElliptic CurvesMazur's theoremXYZ modeleight-vertex modelrational pointsroots of unitytorsion pointstransfer matrices
Nov 21, 20266 pages
PDFView work

math.RT — Representation Theory

Crystal Structures on Theta Bases

Contributed by Jiarui Fei

We construct crystal operators on the regular theta functions of skew-symmetrizable cluster algebras with polynomial frozen variables. A frozen vertex that becomes a sink under mutation defines a locally nilpotent derivation of the upper cluster algebra. These derivations satisfy the Serre relations. Under mutable reddening, the regular theta basis of the middle algebra is perfect for both the sink and the source derivations. In each seed the gg-vectors of its elements are the integral points of a rational polyhedral cone. A tropical criterion detects the sink and source operators that form Chevalley pairs. Such pairs give integrable Kac--Moody actions and, under reddening, normal crystals on the regular theta basis. In the skew-symmetric case with mutable reddening and finite-dimensional Jacobian algebra, we compute the order of the theta function attached to a supported presentation weight along each frozen divisor. We illustrate this theory on various examples.

Author comments: 49 pages, comments are welcome

Primarily human-written textHuman understanding: all partsCluster AlgebraTheta basiscystal structure
Nov 21, 202650 pages
PDFView work

math.AG — Algebraic Geometry

A short proof of Deligne's bound for Frobenius eigenvalues, after Alpöge

Contributed by Floris Alderliefste

We write out in full the proof, sketched by L. Alpöge in a footnote of his note of 20 November 2026, of Deligne's bound for the eigenvalues of Frobenius. Let XX be a separated scheme of finite type over a finite field with qq elements, and let F\mathcal F be a constructible ℓ\ell-adic sheaf on XX whose Frobenius eigenvalues at each closed point xx have absolute value at most ∣κ(x)∣w/2|\kappa(x)|^{w/2}. Then the eigenvalues of Frobenius on Hci(X,F)H^i_c(X,\mathcal F) have absolute value at most q(w+i)/2q^{(w+i)/2}, and they have absolute value exactly q(w+i)/2q^{(w+i)/2} if XX is smooth and proper and F\mathcal F is lisse and pure of weight ww. The proof is short. Granted the formalism of étale cohomology (the trace formula, the Künneth formula, Poincaré duality and Artin's vanishing theorem) and a weak Lefschetz theorem for generic hyperplane sections of affine varieties, it takes less than six pages, and its only estimate is the Cauchy–Schwarz inequality for a character sum over a finite field. Lefschetz pencils, monodromy and Rankin's method are not used. The proof was produced by GPT-6 Astra (ChatGPT Pro mode) from that sketch. It was checked by Claude Opus 5.5 at effort high and, independently, by Claude Fable 5.2 at effort max, which also wrote this text. No human has checked it.

Author comments: This note writes out, with full proofs, the argument sketched in footnote 3 of L. Alpöge's note of 20 November 2026 (https://alpo.ge/remark.pdf); its ideas are his. The weak Lefschetz theorem it uses is Deligne's, from the appendix of N. Katz, Affine cohomological transforms, perversity, and monodromy, J. Amer. Math. Soc. 6 (1993). Checks: every step was checked by Claude Opus 5.5 at effort high and re-proved independently by Claude Fable 5.2 at effort max; no human has checked the proof. The prompt, the output of the run and the check records are at https://github.com/KokunoYumeto/grothendieck-montpellier-archive/tree/main/research/grh_20261120/deligne_sign_only

Primarily AI-generated textHuman understanding: no partsAI-generated mathematicsFrobenius eigenvaluesRiemann hypothesis over finite fieldsWeil conjecturescharacter sumsexposition of a proof sketchtensor powersweak Lefschetz theoremweightsétale cohomology
Nov 21, 202610 pages
PDFView work

math.NT — Number Theory

Failure of the Li–Liu spectral hypothesis R under Dirichlet GRH

Contributed by Yilin Liu

Under Dirichlet GRH, the Li--Liu spectral hypothesis R fails. For every fixed D>0D>0 and 0<ε<10<\varepsilon<1, each sufficiently large interval [X,2X][X,2X] contains at least Xexp⁡(−(log⁡X)ε)X\exp(-(\log X)^\varepsilon) even integers NN for which N ∥TN∥>(log⁡N)D\sqrt N\,\|T_N\|>(\log N)^D. We construct these integers unconditionally and use GRH only at the modulus NN to obtain the norm bound. Each has at least (log⁡N)D(\log N)^D representations as a sum of two distinct primes. The proof isolates a matrix entry in which the continuous model cancels and the two arithmetic terms have different Buchstab densities.

Primarily AI-generated textHuman understanding: no partsBuchstab functionDirichlet GRHGoldbach representationsprimes in short intervals
Nov 21, 20264 pages
PDFView work

math.NT — Number Theory

Two smooth summands for every large integer

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For every ε>0\varepsilon>0, every sufficiently large integer NN is a sum of two positive integers all of whose prime factors are at most NεN^\varepsilon. We prove this smooth-summand conjecture of Erdős using weighted dilation graphs, a uniform character-energy estimate, and a positive marked principal term.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000277. Pinned manuscript, original Lean statement, development, and verification evidence: https://github.com/Ghuffy1/erdos-334/tree/0f66e1d94275854de3a6bee7d109c4d2b5cecb35

Primarily AI-generated textHuman understanding: no partsDirichlet L-functionsadditive representationsdilation graphssmooth numbers
Nov 21, 202660 pages
PDFView work

math.CO — Combinatorics

A locally sparse graph with superlinear Ramsey growth

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct a fixed finite bipartite graph GG such that every set of at least two vertices spans at most twice its cardinality minus three edges, while the ratio R(G,H)/e(H)R(G,H)/e(H) is unbounded as HH ranges over graphs without isolated vertices. For all sufficiently large mm, R(G,K2570m)>21144m−1R(G,K_{2^{570m}})>2^{1144m-1}. This gives a negative answer to Erdős problem 566. The construction uses a layered two-parent graph and a random subset of a Hamming cube. A conditional-entropy inequality excludes the fixed graph. A bound on the negative Krawtchouk spectrum and an independent-set encoding exclude large independent sets.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000456. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-566/tree/ac0b12b5cb264a092ef1cdf6304760dcdc4b6328

Primarily AI-generated textHuman understanding: no partsHamming cubeRamsey numbersentropy
Nov 21, 202612 pages
PDFView work

math.NT — Number Theory

Erdős 196: A permutation of the natural numbers with no monotone four-term arithmetic progression

Contributed by Jensen Kohlmeyer, Liam Kruer

We construct a permutation of the natural numbers containing no increasing or decreasing four-term arithmetic progression as a subsequence. This gives a negative answer to Erdős problem 196. The construction extends finite prefixes while preserving closure and consistency of binary preferences. To extend a prefix, we order a new finite block by an adapted binary order and impose saturation at the nodes where the old prefix branches. Finiteness follows from the weight w(n)=2ρ(n)nw(n)=2^{\rho(n)}n, where ρ\rho is a finite binary residue rank. The extension can include any prescribed finite set. Iteration gives a bijection of order type ω\omega on the natural numbers. The finite extension theorem, the resulting bijection, and the exact negative answer are formalized in Lean 4.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000185. Pinned source and Lean verification materials: https://github.com/lkruer/conjectures/tree/bf058b903350eb8f873a22ab4a54b2e0faa9727d/problems/erdos-196

Primarily AI-generated textHuman understanding: no partsarithmetic progressionsbinary ordersinfinite permutations
Nov 21, 20267 pages
PDFView work

math.LO — Logic

A set mapping with small intersections and no large free set

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let μ\mu be an uncountable cardinal of countable cofinality and suppose that 2μ=μ+2^\mu=\mu^+. We construct a self-avoiding set mapping on μ+\mu^+ whose values have cardinality at most μ\mu, whose distinct values have intersection of cardinality less than μ\mu, and which has no free set of cardinality μ+\mu^+. The construction combines a countable neighborhood base with an enumeration of the μ\mu-sized subsets and a schedule having fewer than μ\mu requirements at each bounded depth. Under the generalized continuum hypothesis, this gives a negative answer to the free-set question of Erdős and Hajnal at ℵω+1\aleph_{\omega+1}.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000978. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-1173/tree/7c7a362c0f426ddb3e55e9e43a5a51f859a4e0ca

Primarily AI-generated textHuman understanding: no partsfree setsset mappingssingular cardinals
Nov 21, 20263 pages
PDFView work

math.LO — Logic

Erdős problem 597 and finite-target independence

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We study the graph-target partition relation ω12→(ω1⋅ω,H)2\omega_1^2\to(\omega_1\cdot\omega,H)^2 from Erdős problem 597. In ZFC we construct a connected bipartite graph of cardinality ℵ1\aleph_1 and diameter at most three, containing no Kω,ωK_{\omega,\omega}, for which this relation fails. We also construct a fixed finite K4K_4-free graph H0H_0 for which the relation fails under the continuum hypothesis. Under Martin's axiom at ℵ1\aleph_1, it holds for every finite graph. Consequently the universal finite-target assertion, and the assertion for H0H_0 itself, are independent of ZFC, relative to the consistency of ZFC.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000484. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-597/tree/279825a39739918a2553880a32ec9ab1dee1f780

Primarily AI-generated textHuman understanding: no partsOrdinal partition relationsindependenceinfinite graphs
Nov 21, 20266 pages
PDFView work

math.NT — Number Theory

Recurring differences from overlapping arithmetic progressions

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give sufficient conditions for the signed differences occurring infinitely often in a set of natural numbers to have bounded gaps. The hypotheses use pairs of finite arithmetic progressions with coprime step quotients, positive normalized overlap, and bounded mutual distance. Bounded perturbations of the progressions are allowed. A finite circular-gap criterion gives the explicit bound 2gH+4C2gH+4C, including equality at the overlap threshold. Exact centered pairs yield a finite-intersection theorem. Separated constructions realize these conditions at zero upper Banach density and give examples with no recurrent three-point pattern, no infinite arithmetic progression of recurrent differences, and infinitely many pairwise almost disjoint translates. Further examples describe the rational limiting threshold and the order of the quantitative gap bound.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000276. Pinned source and Lean verification materials: https://github.com/Ghuffy1/erdos-332/tree/cf1e6ab6401ce288dcb4194fdfe314c2edb2fc84

Primarily AI-generated textHuman understanding: no partsarithmetic progressionsrecurrent differencessyndetic sets
Nov 21, 202610 pages
PDFView work

math.NT — Number Theory

Asymptotically full minimal signed unit-fraction identities

Contributed by Jensen Kohlmeyer, Liam Kruer, Will Howe, Grant Huffman

Let f(N)f(N) be the largest size of a subset of {1,…,N}\{1,\ldots,N\} admitting a signed zero sum of its reciprocals with no proper nonempty signed zero subsum. We prove f(N)=N−o(N)f(N)=N-o(N) using the subset-sum theorem of Liu and Sawhney. The construction joins finitely many large-prime groups by one CRT-chosen unit fraction. The resulting positive sum can be arbitrarily large, although the density cost of excluding those primes is arbitrarily small. A dense coprime-denominator expansion of that sum provides the opposite side and preserves minimality. Earlier public work claims this asymptotic and the protected-prime construction. This version gives an alternative approach through Liu and Sawhney, with an accompanying Lean formalization.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000265. Pinned source and Lean verification materials: https://github.com/H0W4RD-dev/erdos319-density-one/tree/ed555ed4120225800a6c642e6ba81704d5ed6b11

Primarily AI-generated textHuman understanding: no partsegyptian fractionsprimitive relationsreciprocal sums
Nov 21, 20266 pages
PDFView work

math-ph — Mathematical Physics

Free fermions from integer arithmetic: a Galois-theoretic test for free-fermionic spectra

Contributed by Shankar Sivarajan

The spectrum of a free-fermionic operator is built from a few single-particle quantities. For operators with rational entries this confines, as is known, the Galois group of the characteristic polynomial of each sector to a hyperoctahedral group, up to elementary abelian 22-groups. We turn this into a test for free-fermionic spectra that uses only integer arithmetic: Frobenius cycle types modulo primes can prove that a spectrum is not free-fermionic, and an exact recovery of the single-particle data, certified by power sums, confirms it when it is. As a worked example, the test recovers Onsager's dispersion relation from the characteristic polynomial of the Ising transfer matrix. As applications, we prove that the periodic Fendley chain with generic couplings admits no free-fermion solution of the Chapman--Elman--Mann form for a range of sizes, bearing on whether a simplicial clique is necessary for free-fermion solvability, and we detect hidden tensor-product and matchgate structure in any basis. The Galois group grades spectral structure: hyperoctahedral for free fermions, symmetric on subsets with particle-number conservation, apparently imprimitive for the partially decoupled Bethe equations of the exclusion process, and alternating within sectors for the interacting models tested.

Primarily AI-generated textHuman understanding: all partsfree fermionsintegrable models
Nov 21, 202619 pages
PDFView work

math.CO — Combinatorics

Erdős problem 706 and uniform multiscale refinements

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give a detailed exposition of the OpenAI–Galán argument that resolves Erdős problem 706, including character rigidity, its compact-tower and radial arguments, and the transfer from arbitrary colorings to weak measurable colorings for algebraic distances. Galán’s application of Bukh’s theorem gives finite planar graphs with rr forbidden distances and chromatic number greater than 4.0485r4.0485^r. We also prove a uniform product estimate for normalized compact distance clusters and give quantitative fixed-ratio bounds from weighted unit-distance graphs. The linked Lean verification covers the original negative answer and the elementary bounds 2r≤L(r)≤7r2^r\le L(r)\le7^r.

Author comments: Revised manuscript accompanying Justin Sun Prize submission JSP-000576. Original source package, attribution and verification scope: https://github.com/Ghuffy1/erdos-706-lean/tree/2a22f736eea81c04ec696c1b1d7f770b4417f5f7

Primarily AI-generated textHuman understanding: no partscharacter rigiditydistance graphsgeometric graph coloringindependence density
Nov 21, 202650 pages
PDFView work

math.CO — Combinatorics

Matching order for Erdős problem 790

Contributed by Grant Huffman, Jensen Kohlmeyer, Will Howe, Liam Kruer

Let ℓ(n)\ell(n) be the largest size of a subset guaranteed in every nn-element set of integers in which no element is a sum of at least two distinct other elements. We give an upper bound of order n/(log⁡n)2n/(\log n)^2 by propagating mixed averages through a layered construction and lifting repeated-summand relations to distinct summands. Together with Samuel Korsky’s lower bound, this gives matching upper and lower bounds. A linked Lean development proves the upper bound and matching order, with an independent statement bridge.

Author comments: TeX edition of the public matching-order manuscript for JSP-000649. Pinned publication and contributor credits: https://github.com/Ghuffy1/erdos790-jsp/tree/7c3d195fa10d7b52f4fa4a2165b336396d4b21c0 . Pinned proof and statement bridge: https://github.com/Ghuffy1/erdos790-jsp/tree/0a69771b18df655fe47af2d5fb78a7d125fcd5f0

Primarily AI-generated textHuman understanding: no partsadditive combinatoricsarithmetic progressionsdistinct summandssum-free sets
Nov 21, 20267 pages
PDFView work

math.SP — Spectral Theory

The Square Maximizes the First Nonzero Steklov Eigenvalue Among Convex Quadrilaterals

Contributed by Lüwei Dong, Sirui Yang, Jintao Pan

We show that among all convex planar polygons of prescribed perimeter with at most four sides, the square uniquely maximizes the first positive Steklov eigenvalue. If k∈(0,π/2)k \in (0, \pi/2) denotes the unique root of tan⁡ktanh⁡k=1\tan k \tanh k = 1, then Lσ1(Ω)≤8ktanh⁡kL\sigma_1(\Omega) \le 8k\tanh k, with equality if and only if Ω\Omega is a square. By the quadrilateral isoperimetric inequality, the square also uniquely maximizes the area-normalized eigenvalue ∣Ω∣ σ1(Ω)\sqrt{|\Omega|}\,\sigma_1(\Omega) in the same class. Our proof splits the four-dimensional moduli space of convex quadrilaterals into a neighborhood of the square and its complement. Near the square, a weighted combination of the two first Steklov eigenfunctions of the square produces a negative definite Rayleigh defect; its sign on an explicit parameter box is established via an exact degree-2222 Taylor expansion in ball arithmetic together with an analytic Cauchy remainder estimate. Far from the square, a boundary-variance inequality along a diagonal reduces the remaining shapes to a compact region, which we cover by 940940 closed subboxes using affine and harmonic quadratic trial functions checked in outward-rounded integer interval arithmetic.

Author comments: The authors’ PDF and the source files and computational certificates for this version are available at https://doi.org/10.5281/zenodo.24409123.

A mix of human-written and AI-generated textHuman understanding: all parts
Nov 21, 202610 pages
PDFView work

math.NT — Number Theory

Erdős problem 859: a refutation of the logarithmic density law

Contributed by Liam Kruer, Jensen Kohlmeyer

Let dtd_t be the natural density of integers nn for which tt is a sum of distinct positive divisors of nn. We prove lim inf⁡t→∞(−log⁡dt)/log⁡log⁡t=δ\liminf_{t\to\infty}(-\log d_t)/\log\log t=\delta and (log⁡t)δdt→0(\log t)^\delta d_t\to0, where δ=1−(1+log⁡log⁡2)/log⁡2\delta=1-(1+\log\log2)/\log2. Together these exclude every pure logarithmic power asymptotic with a positive leading coefficient. This exposition gives the exact finite prime model and the density and change-of-measure reductions. It explains the divisor-interval saving and the arithmetic construction and links to the complete formal proof.

Author comments: TeX edition of the expanded Conjectures.io exposition linked from Justin Sun Prize submission JSP-000712. Original expanded PDF: https://conjectures.io/papers/erdos859.pdf?v=20260921-expanded . Accepted Lean source and verification: https://conjectures.io/results/e060355f-a728-4b06-af11-6302b5780d19

Primarily AI-generated textHuman understanding: no partsdivisor intervalsdivisor sumsexponential tiltingnatural density
Nov 21, 202611 pages
PDFView work

math.NT — Number Theory

An exact formula for fork-free sets of integers and the irrationality of their density

Contributed by Liam Kruer, Jensen Kohlmeyer

Let f(n)f(n) be the largest size of a subset of {1,…,n}\{1,\ldots,n\} in which no element divides two distinct other elements. We prove the exact formula f(n)=∑m≤n, (m,6)=1(R(n/m)−1B(n/m))f(n)=\sum_{m\le n,\,(m,6)=1}(R(n/m)-\mathbf{1}_{\mathcal B}(n/m)), where RR is the two-prime grid rank and B\mathcal B is an explicit union of intervals. A matching construction follows from a cutoff recursion whose finite certificates are checked in Lean. The limit c=lim⁡n→∞f(n)/n=0.67296565119948934747…c=\lim_{n\to\infty}f(n)/n=0.67296565119948934747\ldots is irrational. The proof uses rotation returns, a two-cutoff 22-adic nonvanishing argument, and a three-place Subspace Theorem. The linked Lean development verifies the exact formula, convergence, and irrationality.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000882. Pinned manuscript, Lean proof and exact full-statement audit: https://github.com/TheJustinSunPrize/awards/pull/4905

Primarily AI-generated textHuman understanding: no partsSubspace Theoremdivisibilityextremal densityfork-free sets
Nov 21, 202617 pages
PDFView work

math.NT — Number Theory

A periodic-summand characterization for Erdős problem 335

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We characterize pairs of positive-density subsets of the positive integers for which the ordinary density of their sumset equals the sum of their densities. The modular boundary is controlled by literal residue supports. Above that boundary, the classification consists of parallel Bohr intervals with finite backgrounds, two periodic templates with a literal fringe test, or one sparse exceptional section with an exact terminal condition. This overview states the characterization and explains the proof structure. The linked development gives the detailed mathematical arguments and verifies the complete result in Lean using the original positive-integer counts.

Author comments: TeX edition of the four-page overview accompanying Justin Sun Prize submission JSP-000278. Pinned overview, detailed mathematical notes, and Lean verification: https://github.com/Ghuffy1/erdos-335/tree/29e64ce67b4999f76657bb4b51e306076f59e689

Primarily AI-generated textHuman understanding: no partsasymptotic densityinverse theoremsperiodicitysumsets
Nov 21, 20264 pages
PDFView work

math.CO — Combinatorics

Vertex-critical four-chromatic graphs with no small critical edge set

Contributed by Liam Kruer, Jensen Kohlmeyer

For every positive integer rr, we construct a finite four-chromatic graph such that deleting any vertex lowers the chromatic number, and deleting any set of at most rr edges preserves it. The proof combines punctured cyclic three-colorings, an integral height character, an Andrásfai winding bound, and a Chinese remainder construction with an exact classification of its small-deficit characters. Together with the higher-color result of Skottová and Steiner, this gives finite existence for every chromatic number at least four. The accompanying Lean formalization checks the finite-existence theorem.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000785. Pinned source, proof audit and credit for the separate prescribed-order extension: https://github.com/TheJustinSunPrize/awards/pull/5110

Primarily AI-generated textHuman understanding: no partsChromatic numbercritical edge setscyclic graphsvertex-critical graphs
Nov 21, 202613 pages
PDFView work

math.CO — Combinatorics

Monotone classes of bounded game chromatic number have bounded arboricity

Contributed by Peter Graham

In the coloring game on a finite graph, Alice and Bob alternately color uncolored vertices with one of kk colors so that adjacent vertices get different colors. Alice moves first and wins if every vertex gets colored; Bob wins if some uncolored vertex sees all kk colors among its neighbors. The game chromatic number of a graph is the least kk for which Alice can force a win. We prove that for every KK there is dd such that every graph of average degree at least dd has a subgraph on which Bob wins the kk-color game for every k≤Kk\le K. Consequently, if a class of graphs is closed under taking subgraphs and its game chromatic numbers are bounded, then the edges of each of its graphs can be partitioned into a bounded number of forests, that is, the class has bounded arboricity. This answers Zhu's Question 3 (1999) in the affirmative. The proof combines the theorem of Kühn and Osthus that every graph of large enough average degree contains a subgraph of large average degree with no 4-cycle, with a strategy for Bob that adapts the weighting argument behind Beck's criterion for positional games: Bob uses weights to keep some uncolored vertex that can still be blocked from every color. The rest of the proof is checked in Lean, with the theorem of Kühn and Osthus as an explicit hypothesis. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.24376623. The paper text is deposited under CC BY 4.0; the Lean code stays Apache-2.0 in its published repository. Lean 4 development, in its folder lean: https://github.com/6/clank-lab/tree/game-chromatic-arboricity-v1/results/game-chromatic-arboricity

Primarily AI-generated textHuman understanding: some partsarboricitygame chromatic numbergraph coloring gamemonotone graph class
Nov 21, 202610 pages
PDFView work

math.CO — Combinatorics

The Turán density of the tight five-cycle

Contributed by Peter Graham

The tight five-cycle is the three-uniform hypergraph whose edges are the five cyclically consecutive triples on five distinct vertices. We prove that its Turán density is 23−32\sqrt3-3. This answers the conjecture usually attributed to Mubayi and Rödl, explicitly stated by Mubayi, Pikhurko and Sudakov. Mubayi and Rödl's recursive construction gives the lower bound. The upper bound follows the reduction of Bodnár, León, Liu and Pikhurko, whose theorem concerns forbidding both the tight four-cycle and the tight five-cycle, or a tight cycle of length at least seven not divisible by three. We establish the two estimates needed for the five-cycle alone by exact rational certificates, using weighted link inequalities to include configurations containing a complete four-vertex hypergraph. We give the finite counting argument that turns the certificates into these estimates and then into the density bound. The whole proof, including this counting argument, is checked in Lean; its finite computations run as compiled code, so the check trusts Lean's compiler as well as its kernel. This work has not yet been reviewed by experts. The proofs, the Lean formalization and the text were produced by AI models, working under the author's direction.

Author comments: Zenodo archive: https://doi.org/10.5281/zenodo.23743819. The Lean 4 development (folder lean) and the certificate checkers (folder checks) are in the Zenodo archive. Compiled checks the proof relies on: the Lean theorem TightCycleC5.Bridge.mubayi_rodl_checked states, from the definitions, that ex(n, C5)/binom(n,3) tends to 2*sqrt(3)-3 for the tight five-cycle C5. Besides the standard axioms propext, Classical.choice and Quot.sound, it depends on exactly 692 named native_decide facts, evaluated by compiled code, so the check trusts Lean's compiler and runtime as well as its kernel. These facts check finite arithmetic (53 groups of uncolored and 634 colored arithmetic checks), one multiplier quotation identity, two sparse coefficient comparisons and two rational Gram identities; the class covers, arithmetic-range coverage and the other positive-semidefinite matrices (six uncolored, 36 colored) have kernel proofs. Separately, exact-integer Python and C++ checkers (checks/p32 and checks/p33, run by checks/quickcheck.py) re-check the rational certificates behind the paper's two partition estimates, including positivity and class coverage, and reject planted corruptions. checks/FORMALIZATION.md states the trust boundary. License: the paper text is deposited here under CC BY 4.0; the published code, Lean development and data stay under Apache-2.0 in their repository and Zenodo records.

Primarily AI-generated textHuman understanding: some partsLeanTurán densityflag algebrashypergraphtight cycle
Nov 21, 20269 pages
PDFView work

math.AP — Analysis of PDEs

Density of blow-up data and regularity at the blow-up time for the three-dimensional Euler equations

Contributed by Manvir Jaswal

Alpöge, Buckmaster and Coiculescu have constructed smooth odd initial data on T3\mathbb T^3 whose solutions of the incompressible Euler equations blow up in finite time. Running their construction without oddness, with the singularity carried by a fluid particle, we show that data whose solutions blow up in arbitrarily short time are dense among smooth divergence-free fields in L∞L^\infty, H1H^1 and CαC^\alpha, 0<α<5/60<\alpha<5/6. The same holds inside classes of fields invariant under a finite group of isometries of T3\mathbb T^3, such as the Taylor–Green and Kida classes, with blow-up at the same time along a whole orbit. The Euler equations are not well posed in these topologies, and the result says nothing about instability in C1,αC^{1,\alpha} or in HsH^s, s>5/2s>5/2. For both our solutions and those of Alpöge, Buckmaster and Coiculescu, the velocity stays continuous up to the blow-up time TT in H1H^1 and in CαC^\alpha for every 0<α<5/60<\alpha<5/6, so the enstrophy converges, while u(T)∉C5/6u(T)\notin C^{5/6}, curl⁡u(T)\operatorname{curl}u(T) lies in no LpL^p with p>2p>2, and the vorticity on the particle grows faster than (T−t)−2(T-t)^{-2}.

Primarily AI-generated textHuman understanding: no partsHölder spacesTaylor–Green symmetryfinite-time blow-upincompressible Euler equationssingularity formation
Nov 21, 202619 pages
PDFView work

math.NT — Number Theory

Completeness of two floor-doubling sequences

Contributed by Jensen Kohlmeyer, Liam Kruer

We prove that, whenever α,β>0\alpha,\beta>0 and α/β\alpha/\beta is irrational, every sufficiently large integer is a sum of distinct indexed terms of the two sequences (⌊2nα⌋)n≥0(\lfloor 2^n\alpha\rfloor)_{n\ge0} and (⌊2nβ⌋)n≥0(\lfloor 2^n\beta\rfloor)_{n\ge0}. This answers the doubling case of Erdős problem 354 affirmatively. Missing sums induce a nonproduct invariant coupling of symbolic tower systems. Two binary carry estimates force incompatible conclusions about digit transport and zero runs. The linked Lean proof checks the original indexed-sum formulation.

Author comments: Joint base-two manuscript accompanying Justin Sun Prize submission JSP-000294. Pinned Lean sources and verification: https://github.com/JENW1N/complete-math-solutions/tree/af9feb6c310f5cea035e4ec34400c43fec01817e/proofs/erdos354

Primarily AI-generated textHuman understanding: no partsbinary carriescomplete sequencessubset sumssymbolic dynamics
Nov 21, 202613 pages
PDFView work

math.NT — Number Theory

Small maximal integer Sidon sets by finite phase colorings

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Every sufficiently large integer interval {1,…,N}\{1,\ldots,N\} contains an inclusion-maximal Sidon set of size O(N1/3)O(N^{1/3}). A quadratic seed supplies exact integer differences, and a periodically labeled family of anchors covers each relevant local window. Finite-dimensional bounds for affine sign patterns give a fixed alphabet of translates and a common periodic word. Two separated alphabets give Sidon, sum-free tags for all primes. The seed blocks every point outside two intervals of length O(p2)O(p^2) and the multiples of pp, with p≍N1/3p\asymp N^{1/3}. A maximal completion adds only O(p)O(p) elements. The linked Lean verification covers the original upper-bound target.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000154. Pinned paper, Lean bridge and audit are listed at https://github.com/TheJustinSunPrize/awards/pull/5531

Primarily AI-generated textHuman understanding: no partsadditive combinatoricsfinite phase coloringmaximal Sidon sets
Nov 21, 202610 pages
PDFView work

math.CO — Combinatorics

Subexponential bounds for distinct-distance subsets

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let fd(n)f_d(n) be the least mm such that every set of mm points in Rd\mathbb R^d contains nn points whose pairwise distances are all distinct. For every fixed n≥3n\ge3 we prove fd(n)≤2Cndlog⁡2(d+2)f_d(n)\le2^{C_n\sqrt d\log_2(d+2)}, which answers the subexponential-growth question in Erdős problem 1088. A rank–rectangle theorem gives a large rectangle on which a single row or column function describes the entries of a matrix covered by finitely many such functions. The proof uses hyperplane rounding and rank bounds. A geometric induction and successive halving of the affine dimension give the estimate. The pinned Lean source verifies the original subexponential target. The written manuscript supplies the sharper dependence on the number of types and retains its draft status.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000905. Pinned TeX, formal source, and build records are listed at https://github.com/TheJustinSunPrize/awards/pull/5557

Primarily AI-generated textHuman understanding: no partsEuclidean geometrydistinct distanceslow-rank matricesrainbow subsets
Nov 21, 202633 pages
PDFView work

math.NT — Number Theory

The three parts of Erdős Problem 12: counting functions and reciprocal sums

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give a unified account of the three numbered questions in Erdős Problem 12 for sets in which no element divides the sum of two distinct larger elements. The positive answer to the square-root counting question and the negative answer to a universal power-saving bound are prior AlphaProof Nexus results of Google DeepMind, presented here with attribution. For the reciprocal-sum question, the new argument proves that one absolute constant bounds the reciprocal sum for every such set, finite or infinite. It combines a restriction estimate for sifted integers, congruence restrictions on prime fibres, and a predictable sum over random prime-factor prefixes. A companion Lean development checks the three original questions and the uniform reciprocal bound.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000051. Pinned original sources, contribution credits and the verification report are listed at https://github.com/TheJustinSunPrize/awards/pull/5537

Primarily AI-generated textHuman understanding: no partsdivisibilityprimitive setsreciprocal sumssifted integers
Nov 21, 202616 pages
PDFView work

math.NT — Number Theory

Infinitely many decreases in the thresholds for sums of distinct powers

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let TkT_k be the least integer such that every integer at least TkT_k is a sum of distinct positive kkth powers. We prove Tk>Tk+1T_k>T_{k+1} for infinitely many kk. An upper estimate on degrees in every sufficiently large dyadic interval follows from cyclotomic recurrences, exact reduction of rational Fourier phases, and collision estimates for subset sums modulo reserved powers. A lower estimate on infinitely many other degrees follows from the shifted-prime divisor bound of Fan and Pollack. Comparing the two estimates rules out eventual monotonicity.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000287. Pinned manuscript, formal statement and independent checker records are listed at https://github.com/TheJustinSunPrize/awards/pull/5556

Primarily AI-generated textHuman understanding: no partscyclotomic recurrencesdistinct powersfinite differencessubset sums
Nov 21, 202614 pages
PDFView work

math.CO — Combinatorics

A counterexample to Erdős problem 108 via arc graphs

Contributed by Jensen Kohlmeyer, Liam Kruer

For every positive integer MM, we construct a finite triangle-free graph GG of chromatic number at least MM in which every ordinary four-cycle-free subgraph is 6-colorable. Consequently, no chromatic threshold forces a subgraph of girth at least five and chromatic number at least seven, which gives a negative answer to Erdős problem 108. The proof uses a multipartite random graph of bounded acyclic outdegree in which every subgraph under a prescribed degree cap is 4-colorable. An arc-graph construction raises the host chromatic number while partitioning each four-cycle-free subgraph into a part controlled by the degree cap and a forest. The linked Lean verification covers the original negative answer. The written proof includes the triangle-free strengthening.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000120. Pinned original manuscript, formal source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4903

Primarily AI-generated textHuman understanding: no partsChromatic numberarc graphsgirth
Nov 21, 20267 pages
PDFView work

math.CO — Combinatorics

Size Ramsey numbers at high average degree

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that there is a function ff with f(C)/C→∞f(C)/C\to\infty such that every finite simple graph GG of positive order with e(G)≥Cv(G)e(G)\ge C v(G) satisfies R^(G)>f(C)e(G)\widehat{R}(G)>f(C)e(G) for all sufficiently large CC. The estimate is uniform in the order, number of components, and component multiplicities of the target. The proof combines an entropy estimate for connected component types with adaptive sampling and sparse marks on intersections of host neighborhoods. Separate arguments handle targets with a narrow degree range and strongly unbalanced incidence targets. Dyadic degree reductions assemble the estimates without a loss depending on the number of degree scales.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000756. Pinned manuscript, formal source, and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/5536

Primarily AI-generated textHuman understanding: no partsLovász local lemmagraph densitysize Ramsey number
Nov 21, 202627 pages
PDFView work

math.NT — Number Theory

A uniform square-root lower bound for non-unique sums and a resolution of Erdős problem 14

Contributed by Liam Kruer, Jensen Kohlmeyer

For A⊆N0A\subseteq\mathbb{N}_0, let EA(N)E_A(N) count the positive integers at most NN without exactly one unordered representation as a sum of two elements of AA, allowing equal summands. We prove EA(N)>N/12000E_A(N)>\sqrt{N}/12000 for every integer N≥2⋅1024N\ge 2\cdot 10^{24}. Part I of Erdős problem 14 holds with exponent 1/21/2, and the existence assertion in part II is false. The common finite estimate is EA(2T4)>T2/1000−1E_A(2T^4)>T^2/1000-1 for every integer T≥106T\ge 10^6. The proof combines a triple-sum moment identity, pair counting in an arithmetic progression, and incompatible bounds for a finite generating polynomial.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000052. Pinned Lean source and verification records are listed at https://github.com/TheJustinSunPrize/awards/pull/4902

Primarily AI-generated textHuman understanding: no partsadditive representation functionsexceptional setsunique sums
Nov 21, 20268 pages
PDFView work

math.DS — Dynamical Systems

Centered Cocircular Central Configurations for Homogeneous and Logarithmic Potentials

Contributed by Chih-Yao Wu

We classify central configurations of positive masses on a circle centered at their center of mass. For every number of bodies and every potential r−αr^{-\alpha} with α>0\alpha>0, the only such configurations are equal-mass regular polygons. The same conclusion holds for the logarithmic potential. The proof first separates the equality of the masses from the angular geometry. Comparisons obtained from the force equations then reduce mass equality to inequalities for positive kernels and finite probability laws. Different exponent ranges share these comparisons, while requiring different estimates to complete the argument.

Author comments: 94 pages. Extends the Newtonian classification in hexagon:2610.00526 to every positive homogeneity exponent, with the logarithmic endpoint included. The manuscript gives a self-contained proof. Companion Lean development, with build instructions and verification scope: https://github.com/andersonwu2000/Asterism-formalizations/tree/acs12-2026-11-20/projects/acs12

Primarily AI-generated textHuman understanding: no partscelestial mechanicscentered cocircular configurationscentral configurationshomogeneous potentialslogarithmic potentialrigidity
Nov 21, 202694 pages
PDFView work

math.CV — Complex Variables

Cofinite derivative zeros at the order-one threshold

Contributed by Jensen Kohlmeyer, Liam Kruer

We give a complete probabilistic construction of a transcendental entire function for which every nonempty open set contains a zero of every sufficiently high derivative. The construction has log⁡M(r)=O(rlog⁡rlog⁡log⁡r)\log M(r)=O(r\log r\log\log r), hence order exactly one and infinite exponential type. No transcendental entire function of finite exponential type can have this zero property. We also establish a local limiting zero-counting measure for the constructed derivatives. The original existence assertion has prior solution claims, including Eric Hou's preprint. The order-one construction and growth obstruction are the proposed strengthening.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000752. Pinned source: https://github.com/JENW1N/cofinite-derivative-zeros-order-one/tree/2345abdb900662ac832aa8f5d206a3950c7b55dd

Primarily AI-generated textHuman understanding: no partsderivative zerosentire functionsorder and exponential type
Nov 21, 20268 pages
PDFView work

math.NT — Number Theory

Balanced additive complements with bounded representation functions

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct infinite sets A={a1<a2<⋯ }A=\{a_1<a_2<\cdots\} and B={b1<b2<⋯ }B=\{b_1<b_2<\cdots\} of positive integers such that ∣ai−bi∣≤5bi|a_i-b_i|\leq5\sqrt{b_i} for every ii, every integer at least 1638416384 belongs to A+BA+B, and the number of ordered representations of any integer as a+ba+b with a∈Aa\in A and b∈Bb\in B is at most 4700547005. In particular, ai/bi→1a_i/b_i\to1, giving a negative answer to a conjecture of Erdős and Sárközy. The construction uses two nested prime-power scales, a uniform residue bound, and a local cardinality matching.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000950. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1145/tree/9caddccde51364623c3c985c9fddd0b52a023e6b

Primarily AI-generated textHuman understanding: no partsadditive basesadditive complementsrepresentation functions
Nov 21, 20267 pages
PDFView work

math.CA — Classical Analysis and ODEs

An exact algebraic construction for Erdős's interpolation minimum

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

For distinct nodes in [−1,1][-1,1], consider the integral of the sum of the squares of their Lagrange cardinal polynomials. We give a finite algebraic construction of its minimum for every positive number of nodes. For n≥2n\geq2, put k=n−1k=n-1 and d=2n(n−1)d=2n(n-1). A rational symmetric polynomial matrix of order (d+1)k(d+1)^k determines a nonzero rational polynomial of degree at most kd(d+1)kkd(d+1)^k. The minimum is a specified real root of this polynomial. Its index is obtained from signatures at rational sample points. All steps of the value rule use rational polynomial arithmetic, univariate real root isolation, and rational symmetric elimination.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000938. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos-1131-exact-minimum/tree/85bd4c4dc7c99de780b7fc7e4a657d0e2b60c473

Primarily AI-generated textHuman understanding: no partsHermite matricesLagrange interpolationreal roots
Nov 21, 20269 pages
PDFView work

math.CO — Combinatorics

A counterexample to Erdős problem 1068

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct in ZFC a simple graph on 2ℵ02^{\aleph_0} vertices with chromatic number ℵ1\aleph_1 such that every infinite induced subgraph is disconnected by deleting finitely many vertices. Consequently, the graph contains no infinitely vertex-connected subgraph, giving a negative answer to the unrestricted formulation of Erdős problem 1068. The construction uses independent vertex sets indexed by a tree of countable sequences. Stabilization of the colors occurring above a node and a recursive choice of a vertex rule out countable colorings. Finite initial histories determine finite separators, which exclude all infinite candidates for the required connectivity.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000887. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos1068-jsp-submission/tree/77b2ad088652305b96ae794a0fa29dbecad05fdf

Primarily AI-generated textHuman understanding: no partsChromatic numberinfinite graphsvertex connectivity
Nov 21, 20265 pages
PDFView work

math.NT — Number Theory

Erdős 1057 / JSP-000877: mathematical account of the submitted proof

Contributed by Jensen Kohlmeyer, Liam Kruer, Will Howe, Grant Huffman

Let C(x)C(x) count the Carmichael numbers at most xx. This account describes the submitted Lean proof of lim⁡x→∞log⁡C(x)/log⁡x=1\lim_{x\to\infty}\log C(x)/\log x=1. It identifies the analytic input from Dirichlet LL-functions, the construction of smooth shifted primes, and the transfer from those primes to sufficiently many Carmichael numbers for every large bound. It links the complete modular and standalone formal proofs and distinguishes their verified exponent-one endpoint from the stronger claims considered in the historical candidate.

Author comments: TeX edition of the mathematical account accompanying Justin Sun Prize submission JSP-000877. Pinned source and Lean proof materials: https://github.com/JENW1N/erdos1057-lean/tree/fd7bc2cac0e0518406be9eb6f07b29cb5239b0e3

Primarily AI-generated textHuman understanding: no partsCarmichael numbersLeanshifted primes
Nov 21, 20264 pages
PDFView work

math.NT — Number Theory

The sharp asymptotic for distinct multiples in an interval: a Lean formalization

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let f(n)f(n) be the least nonnegative integer hh for which the open interval (n,n+h)(n,n+h) contains distinct integers a1,…,ana_1,\ldots,a_n satisfying i∣aii\mid a_i. We give a complete Lean 4 formalization of f(n)∼(2/e)nlog⁡nf(n)\sim (\sqrt{2}/e)n\sqrt{\log n}. The formula was previously announced by David Turturean. The lower bound uses completely multiplicative weights, an exact convolution over powers of 22 and 33, and two inverse-exponential profiles. The upper bound constructs fractional matching weights from finite histograms of prime valuations. Explicit oscillation and stability estimates transfer the continuous transport identities to the integer divisibility graph.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000579. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos710-lean/tree/ee0440a8f58b07bcdc89c8b12606052cb84aac91

Primarily AI-generated textHuman understanding: no partsdistinct multiplesdivisibility matchingformal verification
Nov 21, 202611 pages
PDFView work

math.NT — Number Theory

The sharp deficit in primitive signed reciprocal relations

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let c(N)c(N) be the largest cardinality of a subset of {1,…,N}\{1,\ldots,N\} admitting a signed reciprocal sum equal to zero with no nonempty proper zero subsum under the same signs. We prove N−c(N)∼e−γNlog⁡log⁡log⁡N/log⁡log⁡NN-c(N)\sim e^{-\gamma}N\log\log\log N/\log\log N, where γ\gamma is Euler's constant. The construction joins divisor blocks along a path of primes and completes their reciprocal sum while avoiding those primes. For the converse, we prove a sharp harmonic bound for sets whose reciprocals have no nonempty zero subsum modulo an arbitrary integer. Exact rational representation in a dense sign class then turns this modular bound into a lower bound for the omitted denominators.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000265. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos319-sharp-deficit/tree/43f24b821a8cb8052707fcadc9adcc2cd1678c13

Primarily AI-generated textHuman understanding: no partsegyptian fractionsprimitive relationsreciprocal sums
Nov 21, 202615 pages
PDFView work

math.NT — Number Theory

An Explicit Removal Estimate for Reciprocal-Sum-Free Sets

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let f(N)f(N) be the largest cardinality of a subset of {1,…,N}\{1,\ldots,N\} containing no three distinct elements with 1/a=1/b+1/c1/a=1/b+1/c. We give an explicit uniform removal estimate for finite-prime relaxations of this problem. Together with the smooth-number decomposition, the estimate yields f(N)=CN+o(N)f(N)=CN+o(N) and an effective description of CC by finite optimization problems. If UVU_V is the limiting density obtained by retaining triples with smooth primitive coordinates over the primes at most 2V2V, then 0≤UV−C≤(1023+561000)(log⁡V)−1/1400\le U_V-C\le (10^{23}+561000)(\log V)^{-1/140} for V≥4V\ge4. The proof uses elementary prime estimates, a finite quadratic sieve, and a dyadic decomposition indexed by the larger primitive parameter. We also give rational enclosures of arbitrary prescribed width and an explicit modulus of convergence for f(N)/Nf(N)/N. The finite-prime framework and the underlying sieve are due to the earlier density-limit argument. The emphasis here is the uniform quantitative estimate.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000254. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos302-jsp-submission/tree/1af724ea53a44310c5386062baa22849e6eddafd

Primarily AI-generated textHuman understanding: no partsextremal setssieve methodsunit fractions
Nov 21, 202612 pages
PDFView work

math.CO — Combinatorics

Four-cycles one edge above the extremal threshold

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let h(n)h(n) be the minimum number of four-cycles in an nn-vertex graph with ex⁡(n,C4)+1\operatorname{ex}(n,C_4)+1 edges. We prove that h(nj)=o(nj)h(n_j)=o(\sqrt{n_j}) for a sequence nj=qj2+qj+2n_j=q_j^2+q_j+2, where the qjq_j are powers of four tending to infinity. Consequently, no positive constant gives a universal square-root lower bound one edge above the extremal number. The proof combines a polarity-graph construction with a structural analysis of extremal graphs. Signed deficiencies and a secondary degree-and-triangle minimization produce an open packing of size qq. Completing its adjacency matrix reduces the argument to a trace inequality for a symmetric binary matrix whose residual graph is a union of cycles.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000079. Pinned source and Lean proof materials: https://github.com/Ghuffy1/erdos60-jsp-submission/tree/62aa60b23089cbd4729f1fc4cc850620228c9038

Primarily AI-generated textHuman understanding: no partsfour-cyclespolarity graphssupersaturation
Nov 21, 202615 pages
PDFView work

math.CV — Complex Variables

The (3,4,∞)(3,4,\infty) family of complex six-spheres. V. Complex fourfolds from the family

Contributed by Floris Alderliefste

We construct compact complex fourfolds diffeomorphic, with their complex orientation, to 3HP2#(−HP2)3\mathbb{HP}^2\#(-\mathbb{HP}^2). They form a family of complex three-tori over P1\mathbb P^1 with monodromy in GL6(Z)GL_6(\mathbb Z): two multiple fibres, of multiplicities five and four, and one Kuhn cusp. Its periods come from the exterior square of the genus-two pencil y2=x5+λ3x+λ4y^2=x^5+\lambda^3x+\lambda^4. The family is parametrized exactly by the half-plane Im⁡ξ>c∗\operatorname{Im}\xi>c_*, where c∗≈1.09454c_*\approx1.09454 is minus the minimum of an explicit real-analytic period function. We compute the Hodge numbers, the tangent cohomology (the Kuranishi germ is smooth of dimension one) and the automorphism group C×Z/2\mathbb C\times\mathbb Z/2, and we show that the family extends analytically across no boundary point of its parameter domain. We also construct a compact complex fourfold outside Fujiki's class C\mathcal C as a small crepant resolution of a Weierstrass model, bimeromorphic to the fibre product of a complex six-sphere with an elliptic surface; give an effective classification of the integral monodromy data of this kind that yield three-connected eight-manifolds, all of which are diffeomorphic to 3HP2#(−HP2)3\mathbb{HP}^2\#(-\mathbb{HP}^2); and describe shifted fibre products of complex dimension five.

Author comments: Version 2. Two statements in the introduction are corrected to match their proofs: under the rank-six theorem, each order-two suspension class from the order-four filling transgresses to the global coinvariant (version 1 gave the direction the other way round); and the resolved fourfold is a small crepant resolution of a Weierstrass model, bimeromorphic to the fibre product (version 1 called it a resolution of the fibre product). The statement of Theorem E is made more precise. The rest is streamlining: duplicate proofs merged, equations numbered by section, the main theorems reordered (the resolved fibre product, Theorem A in version 1, is now Theorem F), and the programs collected in one table. Paper V of the five-paper series "The (3,4,∞) family of complex six-spheres". The main result constructs compact complex fourfolds diffeomorphic, with their complex orientation, to 3HP²#(−HP²). The series begins with the complex six-spheres of Claude and L. Alpöge (https://alpo.ge/s6.pdf). Principal related inputs used here are Engel’s elliptic-surface construction (arXiv:2609.38442v1), the weighted-base and direct-image method of Du, Guo, Kusakabe and Xie (arXiv:2610.00250v1), Yang’s toroidal fillings (arXiv:2609.29666v1), the smooth classification of Conway, Crowley, Powell and Sixt (doi:10.1017/S1446788722000167), and Kramer–Stolz sphere absorption. Historical source editions, programs, outputs and check records are at https://github.com/KokunoYumeto/s6-complex-structure-workbench/tree/83d76022bcd442278b760db9ff438afceed6c6ea. The records and programs of this revision are at https://github.com/KokunoYumeto/s6-complex-structure-workbench/tree/af034f283649c6d4b0c6869bfe1e1fcd50346e85/pro_returns/S6_SERIES_PUBLISH_checkpoint_04_20261121T0142Z.

Primarily AI-generated textHuman understanding: no partsAI-generated mathematicsKuranishi familyOka theorycompact complex fourfoldscomplex structuresnon-Kähler manifoldsquaternionic projective planesix-spheretorus fibrationsvariation of Hodge structure
Nov 20, 2026177 pages
PDFView work

math.NT — Number Theory

Infinitely many exceptions to a prime-square representation problem of Erdős

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We prove that infinitely many positive integers have no representation n=ap2+bn=ap^2+b with pp prime, a≥1a\geq1, and 0≤b<p0\leq b<p. More precisely, the number of such integers in (X,2X](X,2X] is of order X/log⁡XX/\log X. The lower bound combines a positive-proportion avoidance estimate for large primes with first- and second-moment estimates for a short average of the small-prime sieve. A separated-frequency argument permits the large primes to be added in finitely many blocks. The small-prime moments have quadratic loss in the cutoff exponent, and a boundary estimate makes the large-prime avoidance stable under the averaging shifts.

Author comments: Manuscript accompanying Justin Sun Prize submission JSP-000549. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos676/tree/3cc60a9fa3b811c10732dcc435f7fe21e0d54cab

Primarily AI-generated textHuman understanding: no partsexceptional setsprime-square residuessieve methods
Nov 20, 20269 pages
PDFView work

math.CO — Combinatorics

A counterexample to the Erdős triangle–four-cycle asymptotic

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct an infinite family of finite simple graphs containing neither a triangle nor a four-cycle. Their edge counts exceed the conjectured leading asymptotic in Erdős Problem 573 by a fixed positive factor. For every positive integer hh, put q=659hq=659^h. The graph GqG_q has nq=(1307/659)q2−qn_q=(1307/659)q^2-q and eq=(428875/6592)q3−(658/659)q2e_q=(428875/659^2)q^3-(658/659)q^2. Its limiting ratio to (nq/2)3/2(n_q/2)^{3/2} is 1.0000452143352195…1.0000452143352195\ldots. The construction joins 47 affine three-part pieces along a common root part. A multiplicative partition of reciprocal field labels excludes four-cycles across the pieces, and an additive restriction retains enough internal edges while excluding triangles.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000463. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos-573/tree/75b87c642d5800f5ce45564236ecf065820c9eb1

Primarily AI-generated textHuman understanding: no partsextremal graph theoryfinite fieldsgirth five
Nov 20, 20265 pages
PDFView work

math.NT — Number Theory

Harmonic dyadic shifts and short sums of factorial divisors

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Let h(N)h(N) be the maximum, over 1≤R≤N1\le R\le N, of the least number of distinct positive divisors of a practical integer NN whose sum is RR. We prove h(n!)=O((log⁡n)9)h(n!)=O((\log n)^9). The main ingredient is a finite entropy lemma. A law modulo 2k2^k with entropy at least gLlog⁡2gL\log 2 in every LL-bit lower prefix becomes supported on more than half the group after O(g−2(log⁡k)2)O(g^{-2}(\log k)^2) independent copies, each multiplied by an independently chosen power of two. The shift distribution is harmonic. A divisor-digit construction supplies g≍1/log⁡kg\asymp1/\log k at linear factorial index. Positive quotient recursion, binary carrying, and a factorial radix then give the stated bound.

Author comments: TeX edition of the manuscript accompanying Justin Sun Prize submission JSP-000055. Pinned manuscript and Lean proof materials: https://github.com/Ghuffy1/erdos18-harmonic-shifts/tree/4b2ed2d07693602fa3b87fb5aa72fe16933f98af

Primarily AI-generated textHuman understanding: no partsShannon entropyadditive basesfactorial divisors
Nov 20, 202610 pages
PDFView work

math.NT — Number Theory

A divisor-closed criterion for Behrend sequences

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We give a necessary and sufficient condition for a set of positive integers to be a Behrend sequence. The condition quantifies over sequences of finite divisor-closed sets supported on consecutive prime blocks. For each element at one level, its permitted extensions at the next level retain a prescribed reciprocal mass. We prove that the set of multiples of AA has natural density one if and only if AA meets every such family. The proof combines the classical Davenport–Erdős finite-approximation theorem with a finite pruning argument for independent geometric prime valuations.

Author comments: The pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000563. Proof repository and verification records: https://github.com/Ghuffy1/erdos691

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20266 pages
PDFView work

math.CO — Combinatorics

A ZFC counterexample to Taylor's conjecture on finite subgraphs

Contributed by Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

We construct, in ZFC, a graph GG of chromatic number ℵ1\aleph_1 such that every graph whose finite ordinary subgraphs embed into GG has chromatic number at most 2ℵ02^{\aleph_0}. Taking the target chromatic number to be (2ℵ0)+(2^{\aleph_0})^+ gives a negative answer to Taylor's conjecture on finite subgraphs. The construction uses hereditarily countable vertex data, finite coordinate inequalities, and a countable-closure reflection argument. A compactness argument transfers the resulting finite coloring properties to the entire finite age of GG.

Author comments: The pinned manuscript and Lean formalization accompany Justin Sun Prize submission JSP-000604. Proof repository and verification records: https://github.com/Ghuffy1/erdos736-jsp

Primarily AI-generated textHuman understanding: no parts
Nov 20, 20267 pages
PDFView work