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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Claude Opus Discussed: 0 Published: 2026-11-11 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00275 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.