NoDI seminar

Root Separation Bound

Hoon Hong 10:30, December 02, 2016 F424 New Main Building, Beihang University

Abstract: : Let f be a square-free polynomial. The root separation of f is the minimum of the pair-wise distance between the complex roots of f. Finding a lower bound on the root separation is a fundamental problem, arising in numerous disciplines. Due to its importance, there has been extensive research on this problem, resulting in various bounds. In this talk, we present another bound, which is "nicer" than the previous bounds in that

(1) It is bigger (hence better) than the previous bounds.

(2) It is covariant under the scaling of the roots, unlike the previous bounds.

We will also describe a generalization to multivariate polynomials systems.

Poster Slides Photos