AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI   Info

Public Audience

English

60 Minutes

Saarbrücken

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. A root separation bound is a lower bound on the root separation.

Finding a root separation bound is a fundamental problem, arising in numerous disciplines in mathematics, science and engineering. Due to its importance, there has been extensive research on this problem, resulting in various celebrated bounds.

However, the previous bounds are still very pessimistically small. Furthermore, surprisingly, they are not compatible with the geometry roots: for instance, when the roots are doubled, the bounds do not double. Worse yet, the bounds even become smaller.

In this talk, we present another bound, which is "nicer" than the previous bounds in that
(1) It is siginificanly bigger (hence better) than the previous bounds.
(2) It is compatible with the geometry of the roots.

If time allows, we will also describe a generalization to multivariate polynomials systems.

This is a joint work with Aaron Herman and Elias Tsigaridas.

Jennifer Müller

2900

--email hidden

passcode not visible

logged in users only