Lehmer's problem: AI breaks high-degree barrier for even degrees up to 2000
A human-AI discovery loop has enabled the construction of irreducible polynomials with Mahler measures below Boyd's limit point for every even degree up to 2000, surpassing the prior limit of degree 180. The team released a verified dataset and introduced the Generalized Boyd algorithm.