In 1933, Lehmer asked whether the Mahler measure of an integer polynomial can be bigger than 1 yet arbitrarily close to it.
His own degree-10 polynomial, at 1.17628, is still the smallest known.
Systematic searches for the smallest value at each degree stopped at degree 180.
Boyd's one-parameter family keeps factoring into cyclotomic pieces, so it skips nearly half of the target degrees.
In this paper, a human researcher and a Gemini agent built a fast numerical solver and an exact verifier together and ran large searches on cloud clusters.
Five different search methods all landed near the same value, 1.2554.
Multiplying the degree-188 result by a cyclotomic polynomial collapsed 111 terms to 7 and revealed Boyd's two-variable polynomial.
That led to Generalized Boyd, a five-parameter construction that solves for the exponents backward from the target degree.
On the same benchmark, the original family filled 504 degrees.
Generalized Boyd filled all 995 even degrees up to 2,000, each with an irreducible polynomial below Boyd's limit point.
Against 91 published records, the authors' searches matched 85 and beat 6, and Generalized Boyd now holds 99.6% of the best-known records.
Lehmer's question stays open.
Beyond degree 2,000 the behavior is predicted by asymptotic analysis, not computed.
Past degree 250 there are no published records to compare against.
There is no baseline without the AI, and the model is an internal Gemini version.
Worth reading if you are building a human鈥揂I search loop for mathematics.
馃搫 arXiv:2610.30277 (Google DeepMind, Caltech)
#AIresearch #papers #math #LehmersProblem #MahlerMeasure #short
Can two tools make a coding agents LEGO buildable? | BrickWright 路 2026.10.22
Does standard softmax hide a bug? | Softmax Fix 路 2026.10.22
Can you pick the data schedule without the learning rate? | Data 脳 LR Schedules 路 2026.10.21