{"id":"hexagon/2611.00275","pdf":"https://hexagonmath.org/pdf/2611.00275v1","url":"https://hexagonmath.org/abs/2611.00275v1","tags":["msc:11R04","msc:11C08","msc:31A05","Schur-Siegel-Smyth trace problem","auxiliary polynomials","ball arithmetic","computer-assisted proof","logarithmic energy","totally positive algebraic integers"],"score":0,"title":"The Schur-Siegel-Smyth trace problem: the lower bound 1.8022246","domain":"math.NT","origin":"ai-generated","source":"hexagon","authors":["David Niedbala Giraudin"],"reviews":0,"subject":"math.NT","summary":"We prove lambda_SSS >= 9011123/5000000 = 1.8022246 for the smallest limiting trace-to-degree ratio of totally positive algebraic integers. The previous best bound is 1.8022225 (Tomar). The certificate consists of fourteen integer polynomials with rational multipliers and a continuous piecewise-linear density with 8678 rational hat weights; its dual inequality is verified on (0,infinity) in ball arithmetic. For the same family of polynomials the value of the underlying optimisation problem is 1.8022247 to within 10^-9 (numerical), so the bound is within 1.1*10^-7 of what this family can give.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Claude Opus"],"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}