Submitted works

Advanced search

math.NT — Number Theory

A Fibonacci Analogue of the Fifteen Theorem

Contributed by Scott Kominers

We prove that a positive-definite quadratic form with integral Gram matrix represents every Fibonacci number if and only if it represents the first forty-two of them. The unique minimal criterion set consists of ten Fibonacci numbers, the largest of which is F42=267914296F_{42}=267914296.

A mix of human-written and AI-generated textHuman understanding: all partsFibonacci numberscongruence coversescalation methodquadratic formsternary quadratic formsuniversal formsuniversality criteria
Nov 12, 202637 pages
PDFView work

math.NT — Number Theory

Consecutive Divisors of Sums of Fibonacci Polynomials: a Luca–Marques Analogue in Finite-Field Polynomial Rings

Contributed by Scott Kominers

For every prime power qq with gcd⁡(q,6)=1\gcd(q,6)=1, we construct infinitely many pairs of consecutive monic polynomials in Fq[T]\mathbb{F}_q[T] whose product divides the Fibonacci-polynomial sum with upper index one less than their common norm. This gives a function-field counterpart of the divisibility condition in the Luca–Marques theorem on consecutive integral arithmetic means of Fibonacci numbers. A short extension of the construction gives infinitely many triples of consecutive monic polynomials with the same property.

Author comments: Dedicated to the memory of Florian Luca

A mix of human-written and AI-generated textHuman understanding: all partsFibonacci polynomialsLucas polynomialsfunction fieldspolynomial recurrences
Nov 10, 20268 pages
PDFView work

cs.CC — Computational Complexity

On counting satisfying assignments via polynomial separation

Contributed by Scott Kominers

We give a preliminary exposition of a qualitative form of the main result of OpenAI's preprint "The Exponential Time Hypothesis is false": for every fixed ε>0\varepsilon>0, 33-SAT on nn variables with mm clauses can be decided in time Oε(2εn(n+m)O(1))O_\varepsilon(2^{\varepsilon n}(n+m)^{O(1)}) and polynomial space. We separate the general counting procedure from the construction that supplies its input. The procedure deforms the clause inputs so that, at designated points, the count factors into local sums, from which Hermite interpolation recovers the original count; the construction builds such deformations from coordinate swaps in a tensor basis, leveraging a parity interpolation in the spirit of Alman and Williams.

A mix of human-written and AI-generated textHuman understanding: some parts3-SATExponential Time HypothesisHermite interpolationpolynomial interpolationsparsification
Oct 27, 202611 pages
PDFView work

math.HO — History and Overview

10/24/2610/24/26: Factoring a Pythagorean Date

Contributed by Scott Kominers

Written numerically, the date October 24, 2026 corresponds to a Pythagorean triple---the last one of the twenty-first century! The associated 1010--2424--2626 right triangle has area twice its perimeter; a classical factorization shows that exactly three integer-sided right triangles have this property and, more generally, counts those with any prescribed integer inradius. We also observe that 6060 is the smallest perimeter shared by two noncongruent integer-sided right triangles, one of which is the 1010--2424--2626 triangle.

A mix of human-written and AI-generated textHuman understanding: all partsPythagorean datesPythagorean triplesequable trianglesrecreational mathematics
Oct 26, 20266 pages
PDFView work

math.NT — Number Theory

Small algebraic integers and Frobenius prime sums

Contributed by Scott Kominers

The determinant argument in recent proofs of Landau–Siegel zero exclusion compares the size of a nonzero integer with its divisibility by inert primes. We observe that the same comparison applies to every Frobenius class in a finite Galois extension of Q\mathbb{Q}, bounding its weighted prime count in terms of the supply of small algebraic integers. For each fixed field, the resulting height bound implies a weighted Chebotarev theorem whose only analytic inputs are the elementary Chebyshev and Mertens estimates. In the quadratic case there are only two Frobenius classes, so the lower bound obtained by complementation remains uniform in the conductor; this recovers Landau–Siegel zero exclusion.

A mix of human-written and AI-generated textHuman understanding: all partsChebotarev density theoremFrobenius congruenceGalois extensionGeometry of numbersLandau–Siegel zeroWronskianinterpolation determinant
Oct 22, 20268 pages
PDFView work

math.MG — Metric Geometry

Multi-coverings by lattice translates of convex bodies

Contributed by Scott Kominers

We show that for every convex body K⊂RnK\subset\mathbb R^n (n≥2n\ge2), every 0<ε<10<\varepsilon<1, and every prescribed density ρ≥Aεnlog⁡n\rho\ge A_\varepsilon n\log n, there is an arrangement of translates of KK along a single lattice with mean multiplicity exactly ρ\rho and multiplicity at least (1−ε)ρ(1-\varepsilon)\rho everywhere. Consequently, lattice kk-fold coverings exist with density at most max⁡{(1+ε)k,Cεnlog⁡n}\max\{(1+\varepsilon)k,C_\varepsilon n\log n\}, where CεC_\varepsilon depends only on ε\varepsilon. In sufficiently large dimension nn, a version with prescribed common covolume holds simultaneously for up to exp⁡(nc0)\exp(n^{c_0}) bodies whose uniform distributions have a common covariance matrix, with c0>0c_0>0 absolute. The proof builds on OpenAI's horizontal–vertical construction for single-lattice coverings and uses Gaussian layer averaging and Laplace bounds for covering counts.

A mix of human-written and AI-generated textHuman understanding: all partsGeometry of numbersconvex bodiesconvex geometrycovering densitycovering multiplicitylattice coveringmulti-covering
Oct 09, 202627 pages
PDFView work

math.MG — Metric Geometry

A Fourier Consequence for Lattice Kissing Numbers and Average Contacts

Contributed by Scott Kominers

We deduce a new asymptotic upper bound Klat(n)≤(2e/π+o(1))nK_{\mathrm{lat}}(n)\leq\left(\sqrt{2e/\pi}+o(1)\right)^n on the maximal lattice kissing number Klat(n)K_{\mathrm{lat}}(n) in dimension nn, using the explicit auxiliary functions constructed in OpenAI's "Ten Advances" preprint. The same bound holds for the average contact degree of a finite packing of congruent balls. The bound's base-22 exponential rate rounds to 0.39560.3956, matching the value extrapolated empirically by Afkhami-Jeddi, Cohn, Hartman, de Laat, and Tajdini in 2020.

A mix of human-written and AI-generated textHuman understanding: all partsContact numbersDiscrete geometryEuclidean latticesFourier linear programming boundsGeometry of numbersKissing numbersSphere packing
Oct 02, 20269 pages
PDFView work

math.MG — Metric Geometry

Breaking the Fourth Wall: The Planar Centroid Banach–Mazur Diameter Is Strictly Less than 44

Contributed by Scott Kominers

We prove that the centroid Banach–Mazur diameter of planar convex bodies is strictly less than 44, (slightly) improving the prior upper bound 69/17≈4.0588269/17\approx 4.05882 due to Lassak. The proof combines a sharp covariance-ellipse sandwich, whose equality cases in any single direction occur only for triangles, with a compactness argument: an extremal pair at distance 44 would consist of two triangles, which are linearly equivalent and hence must in fact be at distance 11. The resulting gap below 44 is uniform but nonquantitative.

A mix of human-written and AI-generated textHuman understanding: all partsBanach–Mazur diameter
Sep 28, 202611 pages
PDFView work