Root Separation for Trinomials - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2019

Root Separation for Trinomials

(1, 2)
1
2

Abstract

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log (\deg f)$. It is known that no such bound is possible for 4-nomials (polynomials with 4 monomials). For trinomials, the classical results (which are based on the degree of $f$ rather than the number of monomials) give separation bounds that are exponentially worse. As an algorithmic application, we show that the number of real roots of a trinomial $f$ can be computed in time polynomial in the size of the sparse encoding of~$f$. The same problem is open for 4-nomials.
Fichier principal
Vignette du fichier
revised.pdf (223.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

ensl-01585049 , version 1 (11-09-2017)
ensl-01585049 , version 2 (13-12-2017)
ensl-01585049 , version 3 (24-10-2018)

Identifiers

Cite

Pascal Koiran. Root Separation for Trinomials. Journal of Symbolic Computation, In press. ⟨ensl-01585049v3⟩
294 View
157 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More