Let c2 be the best constant in the weak type (1,1) inequality for the centred Hardy–Littlewood maximal operator over axis-parallel squares in the plane. We prove 1.7027237335≤c2≤3.59123, improving the bounds 1.6855…≤c2<3.615749 obtained by Lin. The upper bound comes from a new kernel in Lin's comparison principle, which bounds c2 by half the integral of a suitable kernel; closed forms for the fractional operator in this principle make its conditions checkable. The lower bound comes from a periodic measure obtained by modifying Lin's lattice of point masses. Both proofs are computer-assisted and formally verified in Lean.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716077
A mix of human-written and AI-generated textHuman understanding: all parts
For an algebraic number α let h(α) be its absolute logarithmic Weil height, and let hZ(α)=h(α)+h(1−α). The essential minimum of hZ is the supremum of the numbers H for which only finitely many algebraic numbers satisfy hZ(α)≤H. Zagier showed that it is at least 21log21+5=0.2406059…, and the best lower bound so far is 0.24874, due to Flammang. We prove that the essential minimum is at least 0.24982933. The proof combines Smyth's method of auxiliary functions, here with five integer polynomials in z(1−z), with a logarithmic energy term relative to a measure on the circles ∣z∣=1 and ∣1−z∣=1. Resultants and discriminants of minimal polynomials are nonzero integers. They bound the polynomial terms and the energy term, and a condition on the degrees absorbs the leading coefficients, so the argument applies to all algebraic numbers. A superharmonicity argument reduces the positivity of the auxiliary function to the unit circle, where two separately written programs verify it in ball arithmetic for a certificate with exact rational data. We also prove this lower bound in Lean.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23552587
A mix of human-written and AI-generated textHuman understanding: all parts
The moving sofa problem in a snake-shaped corridor, posed by O'Rourke and by Georgiev, Gómez-Serrano, Tao and Wagner, asks for the largest volume of a connected body that can be moved through a corridor of unit-square cross-section with two turns that are far apart, one in the x–y plane and one in the y–z plane. The largest reported body has volume at least 1.8558404, and Tang obtained upper bounds for this problem, the best of which is 3.4083. We prove by hand that the largest volume is at most 22 whenever the straight section between the turns is longer than 2+2. The main new tool is a sharp bound: two infinite tubes of unit-square cross-section whose axes make an angle θ meet in volume at most 1/sinθ. With it, Hammersley's argument for the planar moving sofa problem carries over to three dimensions. The same argument gives explicit bounds for shorter straight sections; these and the main bound have also been proved in Lean 4 with Mathlib.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716059
A mix of human-written and AI-generated textHuman understanding: all parts
Let C be the supremum of P[X1+X2+X3<2X4] over all probability measures on [0,∞), where X1,…,X4 are independent with the given law. Determining C is Problem 6.39, the beat the average game, in the list of Georgiev, Gómez-Serrano, Tao and Wagner. Bellec and Fritz proved 0.4006953≤C≤673/1615 and conjectured that the lower bound, 0.4006953723…, is the exact value. We prove C≤0.40069634, less than 10−6 above the conjectured value. The proof applies Razborov's flag algebra method to samples of nine points. Since the points are independent, the positivity constraints of flag algebras hold for every single measure, so that no limit objects are needed. An exact certificate is checked in rational arithmetic, and the bound is also proved in the Lean 4 proof assistant, with Lean's kernel checking the certificate.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715999
A mix of human-written and AI-generated textHuman understanding: all parts
In its convex form, Moser's worm problem asks for the least area of a convex set in the plane that contains a copy of every arc of length 1. For the version in which the copies may be rotated and translated but not reflected, we prove that this least area M+ satisfies M+≥0.2414; the best bound before, 0.239, follows from Keller's bound for the version with reflections. The proof bounds the area of the convex hull of copies of five polygonal arcs, among them two zigzags that turn in opposite directions, so that without reflections the hull must contain a zigzag turning each way. A branch and bound over the placements of the arcs, with second-order Taylor bounds for signed areas of polygons, produces a certificate, which is checked in ball arithmetic and in the Lean proof assistant.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23717800
A mix of human-written and AI-generated textHuman understanding: all parts
We prove that the connective constant μ of the square lattice Z2, the exponential growth rate of the number of n-step self-avoiding walks, satisfies μ≤2.6586513. The previous best upper bound, μ≤2.662342426, is due to Couronné. Like the bounds of Pönitz and Tittmann and of Couronné, ours comes from a finite automaton that remembers a bounded part of the past of the walk. The new idea is to count bridges. Since they can all be preceded by the same infinite history, the automaton may treat as visited the unvisited cells that no infinite self-avoiding continuation can reach, and three tests on the current state and the next step recognize such cells. The bound is checked in exact integer arithmetic and proved in the Lean proof assistant.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715896
A mix of human-written and AI-generated textHuman understanding: all parts
We prove that ζF(3)=∑n≥1Fn−3 is irrational, where Fn are the Fibonacci numbers. To our knowledge the only odd value of the Fibonacci zeta function previously known to be irrational was ζF(1). The proof is a Hankel-determinant construction over Z[φ], φ=(1+5)/2, adapted from a recent unrefereed construction for the q-zeta value ∑n2/(pn−1) at integers p≥2. Four estimates are combined: a real decay of size exp(−92K3logφ), a smallness exp(−K3logφ) at the Galois conjugate, which replaces the base-prime content gain of the integer case, local cyclotomic denominator bounds at the twisted roots of unity that occur, and nonvanishing by rational interpolation. The whole argument is formalised in Lean 4 with Mathlib.
Romanoff proved in 1934 that the integers of the form p+2a, with p prime and a≥1, have positive lower density d. We prove that d≥0.110825 and, conditionally on an upper bound for prime pairs that Johnston and Trudgian derive from Lichtman's work on primes in arithmetic progressions, that d≥0.119178; the best lower bound so far was 0.10788. The proof refines the method of Elsholtz and Schlage-Puchta, which bounds the second moment of the number of representations in each residue class modulo a fixed integer. Both bounds are certified by computer and also proved in the Lean proof assistant, with the analytic inputs as hypotheses.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23715954
A mix of human-written and AI-generated textHuman understanding: all parts
The Schur–Siegel–Smyth trace constant C86 is the lower limit of tr(α)/deg(α) over totally positive algebraic integers α. We prove 1.8022225<C86<1.8070809. For the upper bound we exhibit a measure on [0,6] that satisfies the hypotheses of Smith's theorem on limits of distributions of conjugates, which we check with the help of 21 integer polynomials. This improves the upper bounds 1.8216 of Orloski and Talebizadeh Sardari and 1.8117251 of Pinho. The lower bound comes from the method of Orloski, Talebizadeh Sardari and Smith with fifteen polynomials, three of them of degree 10 found by McKee and Smyth. It is larger than the bound 1.80220 reported by Giraudin, whose verification evaluates its bounds in floating-point arithmetic with fixed safety margins; ours encloses every rounding error. For each bound, two separately written programs check the certificate in ball arithmetic. Both bounds are also proved in Lean 4, the upper bound under the assumption of Smith's theorem, also in a version in which all checks on the certificates are carried out by Lean's kernel. We also give evidence that certificates of this kind cannot lower the upper bound much further without integer polynomials of high degree.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23563968
A mix of human-written and AI-generated textHuman understanding: all parts
For a transcendental entire function f let μ(r) be its maximum term and M(r) its maximum modulus on ∣z∣=r. Erdős asked for the largest possible value B of liminfr→∞μ(r)/M(r). An argument of Clunie gives B≤2/π=0.636619…, and Clunie and Hayman proved B≤2/π−c for an absolute constant c>0 that they did not compute. We prove B≤0.63005. We make the stability argument of Clunie and Hayman quantitative by testing f against trigonometric polynomials at one or both of two consecutive radii where the central index jumps. The proof is computer-assisted, and the theorem is also proved in the Lean proof assistant.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716682
A mix of human-written and AI-generated textHuman understanding: all parts
For finite sets A,B of real numbers and G⊆A×B, Katz and Tao proved in 1999 that {a−b:(a,b)∈G} has at most N11/6 elements whenever A, B and {a+b:(a,b)∈G} have at most N elements; by an argument of Bourgain, bounds of this kind give lower bounds for the dimension of Kakeya sets. We lower the exponent 11/6 to 1.8273, and to 1.8295 in every abelian group. We also prove ∣X−Y∣≤∣X+Y∣1.4209 for all finite sets X,Y of integers, improving the exponent 1.4543 of Kleinwaks; through his transfer theorem, this lowers the upper bound for the sum-difference constant of Gyarmati, Hennecart and Ruzsa from 1.3124 to 1.2962. Both proofs add up entropy inequalities among integer combinations of coordinates of several copies of a random pair, with rational weights found by linear programming; all four bounds are also proved in Lean 4.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716680
A mix of human-written and AI-generated textHuman understanding: all parts
Duncan and Schweinhart proved that the i-dimensional plaquette random-cluster model with cluster weight q on the 2i-dimensional torus has a sharp homological percolation transition at the self-dual point, for coefficients in a field of characteristic other than 2. Their proof needs the point group of the lattice to act irreducibly on the i-th homology of the torus. In characteristic 2 it does not, and the most important case is excluded: q=2 with F2 coefficients, which represents the (i−1)-form Ising lattice gauge theory. We prove the theorem for q=2r with r≥1 and F2 coefficients. The representation-theoretic step is replaced by a transfer-matrix inequality, the classical positivity of the partition functions of 't Hooft's electric-flux sectors; read in the random-cluster representation, this inequality compares the probabilities of homological events. As a corollary, for the ferromagnetic (i−1)-form Ising gauge theory on the 2i-dimensional torus (Wegner's model when i=2), the free energy of every nontrivial 't Hooft twist tends to 0 below the self-dual coupling and to infinity above it as the torus grows. For Bernoulli plaquette percolation (q=1) the characteristic-2 case remains open for i≥2; we describe obstructions to proving it, and on the 4-torus we prove a computer-assisted divisibility theorem for the classes of integral giant cycles just above p=1/2.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716219
A mix of human-written and AI-generated textHuman understanding: all parts
Let γ2 be the Chvátal–Sankoff constant, so that the expected length of a longest common subsequence of two independent uniformly random binary strings of length n is γ2n+o(n). Lueker proved γ2≤0.826280 with a finite automaton that reads a pair of strings as a sequence of minimal match pairs and remembers the last h symbols of each string, for h=8. We carry out his method up to h=13 and prove γ2≤0.821963. For h=13 the certificate lists 165,695,219,469 states of the automaton, reduced by a symmetry. The bound rests on an explicit positive vector for the weighted transition matrix of the automaton; a checker rebuilds every transition with its own code and verifies the required inequalities in exact integer arithmetic. We also give a complete proof that the automaton accepts the truncated canonical decomposition of every pair of strings, the property on which the method depends. The bound γ2≤0.821963 is also proved in the Lean 4 proof assistant, with a computation evaluated by compiled code, and the bounds γ2≤0.825101, γ2≤0.824120, γ2≤0.823290 and γ2≤0.822579 for h=9, 10, 11 and 12 by formal proofs that are checked entirely by the Lean kernel.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23610945
A mix of human-written and AI-generated textHuman understanding: all parts
Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is open. For the Werner states ρ(d,α), a criterion of Costa Rico reduces k-copy undistillability to an inequality for matrices of rank at most two: an alternating sum of the squared norms of their partial traces must be nonnegative. At α=−1/2 we call it the endpoint inequality. It is known for two and three copies, and if it held for every k in some dimension d≥3, NPT bound entanglement would exist. For two copies we show that every equality case has rank two, with its range and that of its adjoint in products of two-dimensional subspaces. We also show that a first failure would produce, at some α>−1/2, an equality case whose range has reduced states of rank at least three on every copy, unlike all known equality cases at α=−1/2. For every k we prove the endpoint inequality on an explicit class of matrices whose ranges generically have such reduced states. For four copies we give a computer-assisted proof of it in every dimension for all matrices C such that the ranges of C and of its adjoint lie in one two-dimensional subspace, as they do for all normal matrices of rank two.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23992370
A mix of human-written and AI-generated textHuman understanding: all parts
We prove Conjecture 1 of Balister, Bollobás and Riordan for site percolation on Zd in every dimension d≥2: for every essential enhancement, activated at any positive density, the enhanced configuration percolates for all p<pc close enough to the critical probability pc. Aizenman and Grimmett gave an argument for this in 1991, but Balister, Bollobás and Riordan found that its combinatorial step can fail. They proved the cases d=2,3, outlined proofs for bond percolation on Zd and for site percolation on the triangular lattice, and left the cases d≥4 open. Near a site that is pivotal for a long connection, our proof reroutes the open path through a finite configuration in which the enhancement creates a connection, inside a ball that need not be centred at the pivotal site. A theorem valid in every dimension makes this possible unless the first and last sites of the path in the ball lie at a corner of the ball, and a mass-transport argument finds a ball where they do not. The method extends to site percolation on fourteen further periodic lattices, among them all Archimedean lattices other than the square lattice, and to bond percolation on the honeycomb lattice. The proof for Zd uses no computer, parts of most lattice proofs are finite computer checks of local configurations, and the main theorems for Zd and for nine of the lattices have been checked in the Lean proof assistant.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23716333
A mix of human-written and AI-generated textHuman understanding: all parts
Whether every entangled state with a non-positive partial transpose (NPT) can be distilled is a long-standing open problem of entanglement theory. It reduces to the Werner states ρ(d,α), which for d≥3 and −1/2≤α<−1/d are NPT but cannot be distilled from one copy; if one of them stays undistillable from every number of copies, NPT bound entanglement exists. We prove that for every d≥3 the state ρ(d,α) is three-copy distillable if and only if α<−1/2, the threshold known for one and two copies, so a third copy does not help. In every dimension we also prove four-copy undistillability for α≥−79/160 and five-copy undistillability for α≥−9/20, and improved bounds of order 1/k for k≥6 copies. The proofs use a criterion of Costa Rico and computer-verified certificates for quartic moment relaxations that hold for all large dimensions at once; for many copies they combine the resulting inequalities with known partial-trace inequalities. Whether −1/2 remains the threshold from four copies on is open.
Author comments: Published on Zenodo: https://doi.org/10.5281/zenodo.23992387
A mix of human-written and AI-generated textHuman understanding: all parts
We construct an algebraically independent set with divergent reciprocal-logarithmic weight, arbitrary prescribed proximity to selected integers and growing integer-power separation on tails. Nevertheless, every tail contains arbitrarily close rational-dilation pairs for each member of a dense family. The necessary integer-power finite-state lemmas and their proofs are included. This supplies a contrasting construction to the bounded-denominator rational-power example in the companion paper.
Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independenceinteger-power separationrational dilations
Starting from Apicella’s private-prime construction, we give a proof draft of divergent reciprocal-logarithmic-weight examples that are algebraically independent, admit any prescribed positive integer-anchor error and have growing mixed-power gaps for rational dilations with bounded denominators. The integer numerator remains unrestricted. We record transcendence and field consequences and retain an elementary reconstruction of Apicella’s rational example in an appendix, with its prior-work attribution explicit.
Primarily AI-generated textHuman understanding: some partsDiophantine approximationalgebraic independencemultiplicative combinatorics
(i) At the arithmetic parameter \delta = 1/3, the three short face diagonals of the negative-cycle ternary Gram form become mutually orthogonal and generate a simple-cubic sublattice of index two; the full lattice is body-centered cubic. (ii) The positive- and negative-cycle Gram tetrahedra admit matching hinge faces. A four-tetrahedron Regge star consisting of one negative-cycle tetrahedron and three positive-cycle tetrahedra has an exactly computable positive deficit angle. (iii) A figure-eight graph with quaternionic cycle holonomies i and j has a nonzero spectral gap; its characteristic polynomial is computed exactly and its smallest eigenvalue is isolated by rational bounds. (iv) The commutator [i, j] = -1 identifies the graph's central Z_2 obstruction with the negative signed-cycle class of the Gram construction. The statements are finite-dimensional results about lattices, piecewise-Euclidean complexes, and unitary graph connections. They do not construct a closed shell, a Lorentzian spacetime, or a solution of the Einstein-matter equations; they do not prove the dominant energy condition or dynamical stability. The term "negative-cycle" refers only to a sign invariant and has no implication of negative physical energy.
Primarily human-written textHuman understanding: all partsSigned Gram matrices
Terras’s coefficient stopping time conjecture asks whether the shortcut Collatz orbit of
every integer n ≥ 2 lies below n when its coefficient ρk = 3d/2k first falls below one. Here
k counts shortcut steps and d counts their odd inputs. We prove that every eligible realizer
descends when the first-crossing word has at most 75 maximal runs of odd inputs. Any
counterexample requires at least 76 such runs, 10 439 860 591 steps and 6 586 818 670 odd
inputs. The proof uses a lower bound on the seed from the length of its odd runs, rational
approximations to log2 3, the verified range of Rozier and Terracol, and Rhin’s estimate
for a linear form in logarithms. We also prove descent for a family with arbitrarily many
odd runs. Two further restrictions narrow the remaining words. An initial square U U in
a failing word satisfies |U | < 35 log2 k. For a counterexample of shortest crossing length,
the reciprocal-sum estimate of Nikzad, Frinkle and Bagherzadeh gives a lower bound on
ρk whose value begins 0.9441733669 . . .. The open inequality compares the least eligible
starting value in each remaining parity class with an explicit threshold.
A mix of human-written and AI-generated textHuman understanding: some parts2-adic congruencesCollatz conjectureDiophantine approximationTerras conjecturecoefficient stopping timefirst coefficient crossingleast positive realizersodd-run decompositionparity vectorsreciprocal sums
Continuing the axiomatic program for astrophysics initiated in previous works, we introduce a gravity-model-independent and scale-independent definition of an \emph{astrophysical system} and of \emph{clusters of astrophysical systems} over arbitrary piecewise smooth spatial manifolds. A cluster is modeled as a subspace of piecewise differentiable sections of matter and gravitational bundles (modulo coincidence on dense open sets), endowed with macroscopic observable functionals and coupled through a parametric field operator Dgrav encompassing Newtonian gravity, General Relativity, and modified gravity theories (f(R), Rastall, scalar-tensor, and MOND-type models). Restricting local equations of state to bounded extended-norm balls (which form affine Banach spaces on fixed partitions) and applying Implicit Function Theorems in locally convex spaces, we prove four universal obstruction theorems: (i) a direct multi-observable obstruction theorem; (ii) a gravity-coupled structural obstruction theorem via locally density-solvable field equations and reference evaluation operators; (iii) a causal lifting theorem for general acoustic cones; and (iv) an \emph{inverse obstruction theorem}, showing that combining causality-constrained equations of state with empirical observable relations induces \emph{a priori} bounds on the parameter space of the gravitational theory. We also prove that finite-dimensional gravity-coupled clusters are closed and nowhere dense in any Hausdorff locally convex topology, and apply our results to compact stars in Rastall and perturbative f(R) gravity, Bowers--Liang anisotropic stars, and galaxies obeying the Baryonic Tully--Fisher Relation.
Primarily human-written textHuman understanding: all partsAstrophysical systemsequations of stateimplicit function theoremlocally convex spacesmass-radius-tidal relationsmodified gravity
We study two rational sequences, called SeqImpar and SeqPar, originally defined by
recurrences and converging to the common limit 5. The ratio of their convergence errors tends
to 1/2. Using this ratio, we construct two Dirichlet series weighted by the von Mangoldt
function and associated with the Riemann zeta function and the Dirichlet beta function. We
prove that these series admit meromorphic continuations whose poles in the critical strip
correspond exactly to the zeros of the respective functions, with residues equal to minus
one-half of their multiplicities. We then prove that an estimate for the partial sum weighted
by SeqImpar and SeqPar is equivalent to the Riemann Hypothesis, and state a parallel
criterion for the Dirichlet beta function. The paper rigorously distinguishes proved identities,
equivalences, and open problems: the coincidence of the number 1/2 with the critical line
does not, by itself, constitute a proof of the Riemann Hypothesis.
Author comments: DOI 10.5281/zenodo.24145199
A mix of human-written and AI-generated textHuman understanding: all partsRiemann Hypothesis
A uniform group is a quotient ZK∗M→Γ→ZKM on which SM acts by permuting the generators, and a flat representation is a representation π:Γ→UK such that each π(gi) has the K-th roots of unity as eigenvalues. These are the quasi-flat matrix models of the group duals Γ⊂SKM+. We show that ZK∗M is flat linear, in the sense that its flat representations separate points, and that for finite groups, flat linearity and stationarity reduce to exact covering problems. We use this to compute a census, and to prove results on the Heisenberg and metabelian groups.
Primarily AI-generated textHuman understanding: some partsFlat modelUniform group
Robin's criterion states that the Riemann Hypothesis holds if and only if σ(n)<eγnloglogn for every n>5040. Nicolas' second criterion, in the form given by Broughan, states that it holds if and only if n/φ(n)<eγloglogn+eγ(2+τ)/logn for every n≥N120569, where Nk is the k-th primorial and τ=2+γ−log(4π); for Nk this inequality reads c(pk)<E(pk). Let N be a colossally abundant number, let q=pk be the largest prime not exceeding the number ξ(N) associated with N by Nicolas, and write Δ(N)=log(σ(N)/N)−γ−logloglogN. For logq≥31 we prove unconditionally that 1.317/(qlog2q)≤Δ(N)−c(q)+E(q)+(22−2−τ)/(qlogq)≤3.973/(qlog2q). Consequently, the second inequality for Nk implies Δ(N)<−0.654/(qlogq). We also prove that the primorials are the extremal cases of the second inequality, and that if it holds for every Nk with e31≤pk≤X, then Robin's inequality holds for every n>5040 with logn≤X(1−log−3X)−logX. A computation over the primes up to X=100,000,008,765,439 verifies this hypothesis, so Robin's inequality holds unconditionally for 5040<n≤101013.6377. To the author's knowledge, this is the largest range for which Robin's inequality has been verified: it extends the range 5040<n≤101013.11485 of Morrill and Platt.
Primarily AI-generated textHuman understanding: all partsChebyshev functionColossally abundant numbersNicolas' inequalityNicolas' second criterionRiemann HypothesisRobin's inequalitySuperabundant numbersprimorial
We identify the rational Ekeland–Hofer capacities of convex bodies with Clarke’s homogeneous dual-action selectors by a direct minimax argument. Convex reduction and a common nonresonant quadratic tail give the cohomological real analogue for bodies invariant under a linear anti-symplectic involution. In the real case, the mod-two index of half-period translation requires linking in the presence of fixed Fourier modes. The real selectors are full actions of generalized brake characteristics and converge to twice the least brake action. Convex approximation includes nonsmooth bodies, and Fourier decomposition computes both sequences on diagonal ellipsoids.
We construct a separable Banach space with the
Daugavet and Schur properties whose norm is midpoint locally uniformly
rotund and G\^ateaux smooth. The
construction combines the ergodic orbit norm of Dantas, Kaasik and Perreau with a
Bourgain--Rosenthal enlargement in the form developed by Kadets and
Werner.
A mix of human-written and AI-generated textHuman understanding: all partsDaugavet propertymidpoint local uniform rotundity
Let U(n,m) be the maximum number of incidences between n distinct points and m distinct unit circles in the plane. We give two constructions and an explicit upper bound for this function. Writing s=min(n,m) and M=max(n,m), the first construction gives a four-piece monomial lower bound for all cardinalities, with balanced exponent 1.041169920. The second gives balanced configurations along an unbounded sequence with exponent 1.0431722305539701, and further unbalanced configurations. The upper bound is U(n,m)≪M+s2/3−2δM2/3+δ, where δ=2−2664/514560000000>2−2665. The constructions use two windows in a relative-norm-one number-field lattice, strengthened arithmetic estimates, and interpolation between local profiles. The upper bound uses finite incidence regularization, prediction, arithmetic heights, and a six-by-five rigidity obstruction. The resulting bounds for the unit-distance problem follow as corollaries.
Primarily AI-generated textHuman understanding: some partsPoint--unit-circle incidencesarithmetic heightsclass field towersincidence boundsnumber-field latticespolynomial partitioningunit distances
We prove the inductive Alperin–McKay condition at every prime for finite simple groups of types A, 2A, B, C, and F4, and for those of type D in characteristic two. We also prove the corresponding block condition for all unipotent blocks of natural groups of type D on their prescribed central quotients.
Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.
Primarily AI-generated textHuman understanding: no parts
We verify the inductive Alperin–McKay condition for G2(q) (q≥3) and 3D4(q) (q≥2) at every odd prime.
Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.
Primarily AI-generated textHuman understanding: no parts
We prove a packing theorem in real and complex normed spaces. Given a possibly infinite family of vectors (vj) whose span has finite dimension r≥1, let M be the supremum of the norms of its finite linear combinations with coefficients of modulus at most one. If M is finite, the family splits into r nonempty sets, each with sum of norms at most M. The same partition works for every norm on the span, using that norm's value of M. We also determine exactly which finite lists of nonnegative numbers can be realized as the norms of a family of capacity one in some normed space of dimension at most k. We also obtain sharp rank-dependent bounds for products of the moduli of the entries on generalized diagonals and the permanent of the entrywise modulus, extending the known nonnegative-matrix bounds to real and complex matrices. The packing theorem also gives sharp support and entropy bounds for doubly stochastic matrices of bounded rank.
A mix of human-written and AI-generated textHuman understanding: all partsStochastic matrixVector packingentropymajorizationmatrix rankpermanent
Whitehead held that neither points of space nor instants of time should be primitive: both
ought to be definable from relations between material things. Region-based theories of
space have largely carried out the spatial half of this program, but the temporal half has
remained informal. This paper offers an expository and philosophical account of Dimiter
Vakarelov’s dynamic mereotopology, developed in five papers between 2010 and 2016, which
aims at a theory of space and time that is point-free in this double sense. We argue that the
program is best read as a staged realization of Whitehead’s demand. Each stage enriches
the primitive spatio-temporal relations between changing regions just enough to recover
a further layer of temporal structure: first moments without order, then an ordered time,
and finally nameable, spatially non-trivial epochs. The staging culminates in a structural
result Whitehead anticipated but never formalized: points of space and points of time turn
out to be different aggregations of one and the same stock of abstract atoms. We also argue
that the representation theorems on which the program rests deliver a reconstruction,
rather than a reduction, of points, and that reconstruction is what Whitehead’s program
requires.
A mix of human-written and AI-generated textHuman understanding: all partsmereotopology; point-free geometry; contact algebra;; representation theorems
Let f be completely multiplicative with independent fair signs at primes. We count starts of constant runs of length at least L in [N,2N), with L=log2N+O(1) and both signs included. The total variation distance to the Poisson law with nominal or exact mean has an explicit equivalent of order LN−2/3, with a coefficient depending on N2−L and Lmod3. After retaining the exact mean and second factorial cumulant, the quadratic Poisson–Charlier approximation has optimal error power 4/3: for every fixed ε>0, its ℓ1 error lies between constant multiples of N−4/3−ε and N−4/3+ε, uniformly in each fixed critical band. The leading correction comes from rational pairs. Keeping all channels up to a fixed height h gives an explicit distance equivalent with power h/(h+1), determined by the first omitted height. The third factorial cumulant has optimal power 41/30. The proof expands around the exact Bernoulli marginals and stops at the first excluded dependent configuration. Arithmetic bounds for fixed configurations and a separate uniform tail estimate control the resulting positive boundary mass. Short square relations and a common algebraic curve bound the triple interactions; a fourth Charlier test detects the two-pair contribution that makes the quadratic exponent optimal.
Author comments: Initial Hexagon deposit of the published Zenodo edition (https://doi.org/10.5281/zenodo.24220727), including its technical companion in the same PDF. Lean formalization and reproducibility archive: https://doi.org/10.5281/zenodo.24220800. Mathematical source text is preserved; source packaging and navigation are adapted.
For the subfactor associated to a generic Karlsson matrix of order 6, the first 18 fixed-space dimensions are the Catalan numbers. We obtain this from the quantum group of a Di\c t\u a limit. A first additional invariant tensor for a quantum 2-transitive overgroup of this group would give a probability measure on closed walks on the kagome lattice with prescribed local distributions. At every even level a straight walk forces its return path and rules out such a measure. At odd levels a family of staircase tests and a 7-letter certificate at level 15 exclude further first occurrences. The least remaining level is 19. We also give an application to free wreath products and examine the second-order variation of the fixed spaces at special parameters.
Primarily AI-generated textHuman understanding: some partsKagome latticeKarlsson matrix
We extend Victoria Lebed’s construction of idempotent solutions of the braid equation by introducing four families of solutions associated with posets. We show that every group can be realized as the automorphism group of such a solution, and establish a classification of solutions that either preserve or interchange the components of each pair. We also characterize when two solutions arising from posets are isomorphic. Finally, for finite posets, we construct two families of involutive solutions whose automorphism groups are explicitly described in terms of the automorphisms and anti-automorphisms of the underlying posets.
A mix of human-written and AI-generated textHuman understanding: all partsYang–Baxter equationposet
We give a countable homogeneous finitely bounded Ramsey structure in a finite relational language with finitely many reducts up to first-order interdefinability but infinitely many self-embedding monoids of reducts. The reducts producing these monoids are first-order interdefinable, while their monoids form a strictly increasing chain. This refutes the existential strengthening of Thomas' conjecture even under the Ramsey hypothesis. The example is an ordered expansion of an equivalence-relation structure. Before the order is added, that structure has exactly five reducts up to first-order interdefinability.
We also give a revised proof of the classification of self-embedding monoids for reducts of the countable existentially closed binary branching semilinear order. Exactly five monoids occur, refining its three-class first-order classification. The proof transfers the known classification for the homogeneous binary branching C-relation from antichains to arbitrary finite configurations. The additional step is a connectivity argument on finite labelled trees, using both preservation and reflection of the reduct's basic relations.
Primarily human-written textHuman understanding: all parts
We show that every automorphism of a modular curve XΔ(N) of genus at least 2, where Γ1(N)⊆ΓΔ(N)⊆Γ0(N), is induced by the normalizer of ΓΔ(N) in PSL2(R), except for five curves, namely X0(37), X0(63), X0(108), a curve of level 37 found by Jeon, Kim and Schweizer, and a curve of level 63 whose non-modular automorphisms had, to our knowledge, not been noticed before. In particular every automorphism of X1(N) normalizes the group of diamond operators, as claimed for square-free N in an unpublished preprint of Momose. The proof combines a twisted Hecke relation, which comes from the Galois action on the Tate module of the Jacobian, with a uniform bound for the dimension of the CM part of the Jacobian and with computations for finitely many levels.
We construct an origin-symmetric convex body of revolution in
R3, with real-analytic boundary and positive principal
curvatures, whose planar sections tangent to a concentric inner ball
all have the same area. The body is nonspherical and has the same
section data as a centered ball. The construction bifurcates from
the unit ball at height 1/3, where degree two is the only
even Legendre resonance. We construct approximate solutions to
arbitrary order and correct them by a Newton iteration on nested
closed parameter sets. A finite-order reduction of the linearized
section operator and measure estimates for its small divisors
provide the inverse bounds needed for convergence.
We prove the Hausel–Letellier–Rodriguez-Villegas conjecture on the mixed Hodge polynomials of generic semisimple GLn character varieties.
Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.
Primarily AI-generated textHuman understanding: no parts
Fix nonincreasing positive integer weights w0,…,wd−1 and define c>1 by (c−1)2∑j=0d−1wjcj=w0. If the total weight is at least two, we prove irrationality of ∑n≥11/(anw0⋯an+d−1wd−1) whenever the positive integers an are strictly increasing and limsupn→∞(logan)/cn=∞. For every nonconstant nonincreasing weight profile, this lowers the sufficient base in the general criterion of Barreto, Kang, Kim, Kovač and Zhang (Bull. Lond. Math. Soc. 58 (2026), e70457, Theorem 3), with the classical base-2 criterion included in the comparison. For weights (3,2,1) the base becomes 34; staircase weights (d,d−1,…,1) give (d+1)1/d. Irregular growth is allowed. A more general form permits nondecreasing sequences and positive integer numerators under polynomial size bounds.
Author comments: 9 pages. Extends the two-weight result in Hexagon 2611.00428v1 to all fixed nonincreasing positive integer weight profiles. Includes a general numerator criterion and a comparison with finite-product substitutions. Source and build instructions: https://github.com/twinheterodox/weighted-reciprocal-growth
Primarily AI-generated textHuman understanding: some partsgrowth criteriairrationalityreciprocal series
For every real polynomial threshold function f of degree at most d on the uniform cube {-1,1}^n we prove AS(f) <= min{n, 6 d b_n (n+d)/(n+2d)} <= (6/sqrt(2 pi)) d sqrt(n) < 2.394 d sqrt(n), where b_n = E|B_n - n/2| for B_n ~ Bin(n,1/2). The previous coefficient was 8/sqrt(2 pi) = 3.1915... The new ingredient is an edge comparison with constant 3/2 in place of 2 in OpenAI's weighted-grading argument: for every positive weight and every sign function h, the number of ordered equal-sign edges of h is at most (3/2)||MH+HM||_HS^2. The proof rests on the exact identity (Z_i M Z_i - M)^2 = I - A_i^2, where A_i is the grade-diagonal part of the multiplication by x_i. Combined with OpenAI's original coupling estimate alone, the lemma already gives AS(f) <= 6 d sqrt(n).
We study quantified versions of two questions on field concentration and power channels posed by Miller and Monticone in OQ14. At a fixed driving frequency and under a common positive permittivity bound, we construct arbitrarily many simultaneous localized electric-field peaks in a single driven field, both in a two-dimensional invariant setting and in finite three-dimensional dielectrics. We also construct arbitrarily many localized peaks in a single normalized outgoing mode of a finite smooth dielectric, with prescribed real part of the complex resonance frequency and an arbitrarily high quality-factor target. The modal normalization is a reciprocal-residue normalization. Its relation to other possible interpretations of the original modal-volume question requires separate justification.
For a specified channel definition, we construct, for every finite N, an N-dimensional counted input space through the same square section at fixed frequency, material bounds, and thresholds. The construction applies when the permitted absolute-bypass threshold exceeds the required passage threshold and when the selected output is the complete outgoing scattering map, including reflection. Thus the corresponding unrestricted uniform finiteness assertion fails. The result does not decide stricter bypass conditions or receiving-only output formulations. These quantified results do not resolve every interpretation of the original OQ14. The formal verification and its scope are described in the manuscript.
Author comments: Initial manuscript. The channel counterexample concerns the specified quantified formulation with the complete outgoing scattering map, including reflection; it does not settle stronger bypass or receiving-only formulations.
Primarily AI-generated textHuman understanding: no partsMaxwell equationsdielectric resonatorsfield localizationoptical channelsscattering theory
Contributed by Ramin Takloo-Bighash, Sarthak Chimni
We study unital finite-index subrings of Rn=Z[t]/(tn).
We compute the cubic cotype function and the quartic total and cocyclic
functions at every prime, including the exceptional factors at 2,
and prove the corresponding global counting theorems in degrees
three, four, and five.
Explicit Hermite sums with determinantal weights give full cotype
formulas for n=4,5, without an asserted closed rational evaluation.
We extend these calculations by a linear lifting recursion for every
degree and by a two-parameter description of every cocyclic subring for
n≥4. The latter gives
$2-2/(n-1)\le\alpha_n^{\cc}\le2$ for the global cocyclic convergence
abscissa, and hence $\alpha_n^{\cc}\to2$. An exact quadratic family of
quintic diagonal counts gives absolute convergence of the residual
Dirichlet series for $\Rea s>19/13$.
All asymptotics are obtained by elementary summation and absolutely
convergent convolution.
A mix of human-written and AI-generated textHuman understanding: all partsIntegral ringsp-adic integration
Starting from the established fact that Markov numbers count perfect matchings of their Markov snake graphs, we give a self-contained proof of the fixed-sum, fixed-numerator, and fixed-denominator orderings proposed by Aigner. The author's Fibonacci-matrix normalization begins with (AC)11−(B2)11=2 for consecutive odd-indexed Fibonacci blocks. Fibonacci matrices prove normalization and fixed-numerator monotonicity. The author's six-piece decomposition proves the remaining fixed-sum comparison and fixed-denominator monotonicity. We credit the matching correspondence to its original 2002–2003 REACH development and distinguish that history from the later ordering theorems.
Author comments: Standalone v4, 6 pages, 2 figures. The normalization and three ordering proofs also appear in Section 5 of Meridians; this standalone presentation makes them easier to find and cite. Earlier proofs of the orderings and the 2002–2003 matching correspondence retain their citations. The general Markov uniqueness conjecture remains open.
Linked chronology:
8 November 2026: standalone v3: https://zenodo.org/records/24053747
11 November 2026: standalone v4, source, figures and finite-check reports: https://zenodo.org/records/24146546
12 November 2026: v4 PDF mirrored on ResearchGate: https://www.researchgate.net/publication/417809122_Aigner's_Three_Monotonicities_from_Fibonacci_Matrices_and_Six_Snake_Pieces
12 November 2026: corrected Meridians v22: https://zenodo.org/records/24167894 ; its Aigner arguments and figures are unchanged. The v4 source's version note records its original synchronization with v21.
13 November 2026: Meridians published on Hexagon: https://hexagonmath.org/2611.00410
Related computational supplements (2 November 2026): https://zenodo.org/records/23874075 ; current trillion-verification evidence accompanies the corrected Meridians archive above.
Earlier project announcements, not announcements of this standalone proof:
21 October 2026, 15:18:25 UTC: X, earlier billion-scale verification: https://x.com/webystar/status/2112926487091282350
23 October 2026, 14:54:57.771 UTC: LinkedIn, earlier 9.3-billion verification: https://www.linkedin.com/posts/elleard-felix-webster-heffern-joseph-by-confirmation-2953a3104_markovnumbers-activity-7519411048115003392-4NaJ
No separate social announcement for this paper has been independently verified.
A mix of human-written and AI-generated textHuman understanding: all partsAigner's conjecturesFibonacci matricesMarkoff numbersMarkov numberscombinatorial number theoryfixed-denominator monotonicityfixed-numerator monotonicityfixed-sum monotonicityperfect matchingssnake graphs
We give an explicit formula, as a single determinant, for the polynomial satisfied by any entry of the limit obtained by scaling a positive tensor of format n1×⋯×nr to arbitrary prescribed one-dimensional margins (Sinkhorn--Knopp scaling, Kruithof's method, iterative proportional fitting). The polynomial is the multilinear resultant, on the Segre variety $\PP^{n_1-1}\times\dots\times\PP^{n_r-1}$, of the linear forms expressing the margin conditions. Its degree is the multinomial coefficient N=(n1−1,…,nr−1d) with d=∑k(nk−1), and for generic tensors its roots are the corresponding entries of all complex solutions of the scaling equations. A Sylvester matrix turns it into an explicit N×N generalized eigenvalue problem, whose null vector recovers the whole limit. The leading coefficient is the principal A-determinant of the product of simplices, that is, the product of the hyperdeterminants of all faces of the tensor. The constant term is likewise a product of face hyperdeterminants, and the faces avoiding the chosen entry split off as a factor independent of that entry. For matrices we also give a short proof, in Pl\"ucker coordinates, of a diagonal form of the eliminant. For every positive tensor, the limit is the unique root for which the Sylvester matrix has a positive null vector of monomials. Generically, the other roots are the corner entries of the solutions of the same scaling equations with complex scaling factors.
Primarily AI-generated textHuman understanding: all partsSinkhorn scaling
Let χ2(z)=∑n≥0z2n+1/(2n+1)2 be Legendre's chi function and Ti2(z)=∑n≥0(−1)nz2n+1/(2n+1)2 the inverse tangent integral. We prove three theorems: χ2(1/q) is irrational for every integer q≥3 with q=4; Ti2(1/q) is irrational for every integer q≥5; and χ2(2/q) is irrational for every odd integer q≥175. All three come from one construction: the Hankel determinants of a moment functional with half-integer poles and geometric weight w, read at w=q−2, w=−q−2 and w=4q−2. Their denominators are bounded prime by prime, their size by a discrete log-gas argument against explicit dual certificates, and their nonvanishing by a reduction modulo an auxiliary prime. The three cases differ at the prime 2, where each needs its own lemma, in the certificates, and in how the nonvanishing lemma is transferred. For large q the three statements follow from the linear independence criteria of David, Hirata-Kohno and Kawashima; for the first two, a 1990 criterion of Hata, which we could not consult, also applies from a threshold unknown to us. Below these ranges the results are new as far as we know. All three theorems are formalised in Lean 4 with Mathlib and checked by the Lean kernel, using only Lean's three standard axioms.
Primarily AI-generated textHuman understanding: no partsHankel determinantsLeanLegendre chi functionPadé approximationdilogarithmformal verificationinverse tangent integralirrationalitylogarithmic potential theory
An Euler triple is a Diophantine triple {a,b,c} with a<b<c=a+b+2ab+1. It extends to the regular Diophantine quadruple {a,b,c,d+}, and it is conjectured that it has no other extension d>c. We prove that an irregular extension forces c<4⋅1048, against c<1098 in recent work of He and Togb\'e. The proof squeezes the index m of the extension, which locates a common term of two Pell sequences, between a floor from congruences, c<8m4, valid for every irregular extension, and ceilings from linear forms in logarithms. The same squeeze, with other bounds, gives three regularity criteria: by the size of b/a, which confines irregular extensions to 1+15381<b/a<33552; by pair coordinates, through the hypergeometric method; and by coprime divisors of the index combinations, which settles every Euler triple with two elements in a ratio j:k with jk≤300. As applications, the three-parameter family of Cipu, Fujita and Mignotte extends only regularly when νA≥2 and K≥643, and when K=1, A∈{2,3} and ν≥2; the latter contains the Hoggatt--Bergum triples, for which this recovers Dujella's theorem for extensions d>c.
A mix of human-written and AI-generated textHuman understanding: some partsDiophantine quadruplesEuler triples
We prove that every equal-parameter Kazhdan–Lusztig left cell in a finite Weyl group is connected by simple left multiplications.
Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.
Primarily AI-generated textHuman understanding: no parts
We prove Lusztig’s conjectures P1–P15 for extended affine Weyl groups with positive integer-valued weight functions.
Author comments: I am posting this manuscript to share the mathematical results themselves. In doing so, I do not seek to assert ownership of the results or claim priority. I welcome anyone interested in checking the arguments or preparing a finished account, and I believe the eventual scholarly credit should go to those who undertake that work.
Primarily AI-generated textHuman understanding: no parts
Let A⊆{1,…,N} contain no two distinct elements whose
difference is a nonzero square, and let s(N) be the largest possible
size of such a set. We prove
\[
s(N)\le CN^{0.9999873}
\]
with an absolute constant C.
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 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 72 slots (positions at which
the Fourier transform is evaluated) in
place of (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) would be too weak, we
prove bounds of order 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), exact counts
at p≡3(mod4), 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.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
To an arithmetic system (prime elements, norms, weights, L-functions) we attach the central charge Cν=∑p(logNp)ν/(Np(Npν−1))⋅(weight of Frobp)−1. Seven worlds share it: number fields, function fields, graphs, finite-type dynamics, knots, tropical geometry, and arithmetic dynamics. We record four universal laws with their exact status. (I) Index-set identity in all seven worlds (number fields to 1013, tropical skeletons to 1031). (II) Critical law Cν∼Φ⋅(ν−1)!/Δν, with Δ the distance to the controlling singularity: a pole (Tate) or the natural boundary (cuspidal); Φ measures reachability (≈0.7 Tate, ≈0.07 cusp). (III) Diagonal main-term theorem: L entire iff cuspidal iff no diagonal main term iff vanishing connected/remainder ratio; item (v) (never-saturating spectral form factor) is at conjecture level, the bridge closed by a companion paper's recurrence-peak criterion. (IV) Law of forgetting in six formulations, unified: forgetting = increasing Δ = rising diagonal fraction = approaching the semicircle (free) = setting η24=1. The core dichotomy (horizontal coordinate σ=1+κ universal, amplitude fingerprinted) is checked on moments. The 24 network (Δ=qη24, Yau--Zaslow, L(11a1,1)/Ω=1/5) and the Neron wild tables are included; everything carries a status label and a corrections register. We prove neither abc, Szpiro, RH, nor BSD.