Absolute root separation

07/02/2019
by   Yann Bugeaud, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/11/2017

Root Separation for Trinomials

We give a separation bound for the complex roots of a trinomial f ∈Z[X]....
research
04/23/2017

Efficiently Computing Real Roots of Sparse Polynomials

We propose an efficient algorithm to compute the real roots of a sparse ...
research
06/19/2018

Approximating real-rooted and stable polynomials, with combinatorial applications

Let p(x)=a_0 + a_1 x + ... + a_n x^n be a polynomial with all roots real...
research
12/09/2020

Counting Real Roots in Polynomial-Time for Systems Supported on Circuits

Suppose A={a_1,…,a_n+2}⊂ℤ^n has cardinality n+2, with all the coordinate...
research
05/12/2022

Order-Degree-Height Surfaces for Linear Operators

It is known for linear operators with polynomial coefficients annihilati...
research
07/19/2021

Root Repulsion and Faster Solving for Very Sparse Polynomials Over p-adic Fields

For any fixed field K∈{ℚ_2,ℚ_3,ℚ_5, …}, we prove that all polynomials f∈...
research
10/29/2020

Convergence of Constrained Anderson Acceleration

We prove non asymptotic linear convergence rates for the constrained And...

Please sign up or login with your details

Forgot password? Click here to reset