Lehmer’s problem asks whether the Mahler measure of an integer polynomial can approach 1 arbitrarily closely while remaining greater than 1.
Human-AI search extends small Mahler measure constructions to higher degrees
The authors report a five-parameter construction that avoids missing degrees and produces irreducible integer polynomials below a benchmark across all even degrees through 2000.
Big Tech
Yuri Chervonyi · Sergei Gukov · Thang Luong
Google DeepMind · California Institute of Technology
Research Digest··2 min read
Chervonyi and colleagues combine AI-assisted programming, distributed computation and exact symbolic verification to construct high-degree integer polynomials with small Mahler measure, a quantity determined by their roots.
§