Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Root separation for integer polynomials (CROSBI ID 622631)

Prilog sa skupa u zborniku | sažetak izlaganja sa skupa

Dujella, Andrej Root separation for integer polynomials // Unlikely Intersections. 2014. str. 5-5

Podaci o odgovornosti

Dujella, Andrej

engleski

Root separation for integer polynomials

We consider the question how close to each other can be two distinct roots of an integer polynomial P(X) of degree d. We compare the distance between two distinct roots of P(X) with its height H(P), defined as the maximal of the absolute values of its coefficients. The first result in this direction in due to Mahler, who proved that the distance is > c(d)*H(P)^(-d+1), for an explicit constant c(d), depending only on d. We will present some recent results in opposite direction, obtained by constructing explicit families of irreducible and reducible polynomials of degree d whose roots are very close. This is joint work with Yann Bugeaud.

polynomials ; root separation

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o prilogu

5-5.

2014.

nije evidentirano

objavljeno

Podaci o matičnoj publikaciji

Unlikely Intersections

Podaci o skupu

Unlikely intersections

pozvano predavanje

03.02.2014-07.02.2014

Marseille, Francuska

Povezanost rada

Matematika