A trace upper-bound certificate with classical auxiliaries on an adaptive density

Primarily AI-generated textHuman understanding: some partsmath.NT — Number Theory

Contributed by Ricardo Pinho

Version 2 / Oct 31, 2026 / CC BY 4.0

Abstract

An exactly specified rational piecewise-linear density gives C86≤1.80560940C_{86}\le1.80560940 for the Schur--Siegel--Smyth trace constant. It uses 28 classical auxiliary polynomials, ten with nonreal roots, and 5,375 rational nodes. Their recorded list occurrences are: Flammang 2019 (all 28), Liang--Wu 2011 (26), Flammang 2009 (21), McKee 2011 (21), Tomar's public A22 pool (18), Aguirre--Peral 2007 (16), and Flammang 2024 (9). The density refines infrastructure originating in Tomar's adaptive-node certificate. We give the full deduction from finite potential and logarithmic-integral checks through Smith's arithmetic-measure criterion and converse theorem, and describe the rigorous continuous enclosures. The contribution is the explicit feasible measure and its smaller upper bound. This note is unrefereed, with no independent human review or formalization.

Provenance statement

Analysis and proof drafting by AI agents under my direction; I reviewed the results at summary level. AI agents also prepared certificates, checking software, and publication materials. No line-by-line human verification is claimed. AI is not an author.

References

  1. A. Smith, Algebraic integers with conjugates in a prescribed distribution, Annals of Mathematics 200 (2024), Theorem 1.5 and Proposition 5.15; https://arxiv.org/html/2111.12660v2.link
  2. B. Orloski and N. Talebizadeh Sardari, A quantitative converse of Fekete's theorem; https://arxiv.org/abs/2304.10021.link
  3. D. Niedbala Giraudin, trace upper-bound certificate, PR 270; https://github.com/teorth/optimizationproblems/pull/270.link
  4. T. Tomar, Schur--Siegel--Smyth trace bounds, unrefereed preprint (21 October 2026), certificate repository; https://github.com/tejasvi/schur-siegel-smyth-trace-bounds.link
  5. B. Orloski, N. Talebizadeh Sardari and A. Smith, trace-bound construction, Mathematics of Computation 94 (2025), 2005--2040; https://arxiv.org/abs/2401.03252.link
  6. V. Flammang, Trace of totally positive algebraic integers and integer transfinite diameter, Mathematics of Computation 78 (2009), 1119--1125, Table 1, rows 22--23; https://doi.org/10.1090/S0025-5718-08-02120-0.DOI
  7. J. McKee, Computing totally positive algebraic integers of small trace, Mathematics of Computation 80 (2011), 1041--1052, Table 1, rows 21 and 23; https://doi.org/10.1090/S0025-5718-2010-02424-X.DOI
  8. R. Pinho, C86 trace certificate , directory complex-auxiliaries , commit e4d9c64 ; https://github.com/rpinho/c86-trace-certificate/tree/e4d9c640ebaf922b8869a81f275c798c09ab89b1/complex-auxiliaries.link

Version history

  1. v1 · 3 pagesSubmitted by Ricardo PinhoInitial depositSupersededOct 30, 2026
  2. v2 · 3 pagesSubmitted by Ricardo PinhoSubmitted as a new versionSupersededOct 31, 2026
  3. v3 · 7 pagesSubmitted by Ricardo PinhoSubmitted as a new versionCurrentNov 03, 2026