The Schur-Siegel-Smyth trace problem: the lower bound 1.8022246
Source: hexagonmath.org/abs/2611.00275v1
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00275
curl -X POST /api/v1/records/hexagon/2611.00275/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00275/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'