Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4

DOI10.5802/jtnb.826zbMath1271.90053OpenAlexW2326976736MaRDI QIDQ1953837

Georges Rhin, Armand Maul, Souad El Otmani, Jean-Marc Sac-Épée

Publication date: 11 June 2013

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/03e6f36b0e64fc84059102907ccce1d104505e96

zbMATH Keywords

rootsinequality constraints

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Polynomials, factorization in commutative rings (13P05)

Related Items (2)

Finding Degree-16 Monic Irreducible Integer Polynomials of Minimal Trace by Optimization Methods ⋮ Searching for Hyperbolic Polynomials with Span Less than 4

Uses Software

• PARI/GP
• GLPK
• GSL

Cites Work

• Unnamed Item
• The totally real algebraic integers with diameter less than 4
• On the span of polynomials with integer coefficients
• Algebraic Equations with Span Less than 4

This page was built for publication: Integer linear programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4