Root Separation
The root separation (or zero separation) of a polynomial P(x) with roots r_1, r_2, ... is defined by
| Delta(P)=min_(i!=j)|r_i-r_j|. |
There are lower bounds on how close two distinct roots of a polynomial can be. In particular, if P(x) is a squarefree polynomial of degree d with discriminant D, then the Mahler bound gives the minimum separation distance between any pair of roots as
See also
Polynomial Discriminant, RootThis entry contributed by Bhuvanesh Bhatt
Explore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Mahler, K. "An Inequality for the Discriminant of a Polynomial." Michigan Math. J. 11, 257-262, 1964.Zippel, R. Effective Polynomial Computation. Boston, MA: Kluwer, pp. 186-187, 1993.Referenced on Wolfram|Alpha
Root SeparationCite this as:
Bhatt, Bhuvanesh. "Root Separation." From MathWorld--A Wolfram Resource, created by Eric W. Weisstein. https://mathworld.wolfram.com/RootSeparation.html