Absolute root separation
Classical Analysis and ODEs
2024-12-10 v2 Symbolic Computation
Number Theory
Abstract
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height (the maximum absolute value of the coefficients) of the polynomial. We improve the known bounds for this problem and related ones. Then we report on extensive experiments in low degrees, suggesting that the current bounds are still very pessimistic.
Cite
@article{arxiv.1907.01232,
title = {Absolute root separation},
author = {Yann Bugeaud and Andrej Dujella and Wenjie Fang and Tomislav Pejković and Bruno Salvy},
journal= {arXiv preprint arXiv:1907.01232},
year = {2024}
}