Premium
On Integer Polynomials with Multiple Roots
Author(s) -
Amou Masaaki,
Bugeaud Yann
Publication year - 2007
Publication title -
mathematika
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.955
H-Index - 29
eISSN - 2041-7942
pISSN - 0025-5793
DOI - 10.1112/s0025579300000231
Subject(s) - mathematics , integer (computer science) , polynomial , diophantine equation , combinatorics , upper and lower bounds , set (abstract data type) , discrete mathematics , diophantine approximation , mathematical analysis , computer science , programming language
A new lower bound is established for the distance between two roots of an integer polynomial, and a new upper bound for the distance between a given real number and the set of zeros of an integer polynomial. The latter result is applied to improve a metrical result in Diophantine approximation.