Metraipolis › archive › dc_cfe7db3cb80c

Breaking the high-degree barrier in Lehmer's problem with a human-AI discovery loop — arXiv:2610.30277

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.30277
License (as archived)
CC0-1.0
Archived
2026-10-25T20:52:49.344Z
SHA-256 of the archived text
90d29eb5d50f08a1c6914d8ec39d82cd310d0ee209986e8834f099daee91d2b7
Stable URL of this page
https://metraipolis.com/documento/dc_cfe7db3cb80c

How to cite

Breaking the high-degree barrier in Lehmer's problem with a human-AI discovery loop — arXiv:2610.30277 — arXiv (en), https://arxiv.org/abs/2610.30277 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cfe7db3cb80c (Metraipolis archive dc_cfe7db3cb80c, sha256 90d29eb5d50f08a1c6914d8ec39d82cd310d0ee209986e8834f099daee91d2b7)
BibTeX
@misc{dccfe7db3cb80c,
  title = {Breaking the high-degree barrier in Lehmer's problem with a human-AI discovery loop — arXiv:2610.30277},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.30277},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cfe7db3cb80c; sha256 90d29eb5d50f08a1c6914d8ec39d82cd310d0ee209986e8834f099daee91d2b7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.30277. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

While artificial intelligence has made rapid progress in mathematical reasoning, many open problems depend on structure that is revealed only through large-scale computational exploration and analytical synthesis. One such example is Lehmer's problem from 1933. It asks whether the Mahler measure of an integer polynomial, which measures how far its roots stray from the unit circle, can be made arbitrarily small. Previously, constructing irreducible polynomials with integer coefficients and small Mahler measure has been carried out systematically only for even degrees $d \le 180$. At higher degrees, Boyd's analytical one-parameter family frequently factors, skipping nearly 50% of target degrees and leaving no general construction for arbitrary $d$. Here, we address the high-degree regime through a human-AI discovery loop, in which we extend the conversational prompting with a fast numerical pipeline, an exact symbolic verifier, and large-scale distributed search. The AI agent prototypes numerical and symbolic solvers locally, launches parallel searches across distributed clusters and works with the human researcher to extract and verify mathematical hypotheses. Through this interactive loop, we derive a five-parameter construction, which we call the Generalized Boyd algorithm. It eliminates degree-skipping and constructs irreducible polynomials with Mahler measure strictly below Boyd's limit point $\alpha_1 \approx 1.255434$ for every target degree. Evaluated across all even degrees up to 2000, our approach improves upon six previously published values and holds 99.6% of all best known records. With this work we release the verified dataset of polynomials with minimal Mahler measure across all studied even degrees.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2610.30277 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-25T20:47:56.821Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).