Finding Degree-16 Monic Irreducible Integer Polynomials of Minimal Trace by Optimization Methods

DOI10.1080/10586458.2013.849213zbMath1291.90147OpenAlexW1999405170MaRDI QIDQ5418070

No author found.

Publication date: 26 May 2014

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2013.849213

zbMATH Keywords

auxiliary functionsSchur-Siegel-Smyth trace problempolynomials with minimal trace

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polynomials in number theory (11C08) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Polynomials (irreducibility, etc.) (11R09) Polynomials (11S05)

Related Items (5)

Salem numbers with minimal trace ⋮ Weil polynomials of abelian varieties over finite fields with many rational points ⋮ Salem numbers of trace -2, and a conjecture of Estes and Guralnick ⋮ A salem number with degree 34 and trace -3 ⋮ Totally positive algebraic integers with small trace

Cites Work

• Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4
• The trace of totally positive and real algebraic integers
• Computing totally positive algebraic integers of small trace

This page was built for publication: Finding Degree-16 Monic Irreducible Integer Polynomials of Minimal Trace by Optimization Methods