Root separation for irreducible integer polynomials

2011/10/06 by Yann Bugeaud, Andrej Dujella · 1 citation
Computer Science · Mathematics · #Polynomial and algebraic computation #Commutative Algebra and Its Applications #Analytic Number Theory Research

paper · doi:10.1112/blms/bdr085

Abstract

We establish new results on root separation of integer, irreducible polynomials of degree at least 4. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Götze (for odd degree).

Cited by

• Distribution of complex algebraic numbers

Related

• Polynomial minimum root separation
• p-adic root separation and the discriminant of integer polynomials
• Improved complexity bounds for real root isolation using Continued Fractions
• Prime numbers and factorization of polynomials
• Improved complexity bounds for real root isolation using Continued Fractions