Some Lower Bounds on the Reach of an Algebraic Variety
Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this paper, we provide bounds on the reach of a smooth algebraic variety in terms of several invariants of interest: the condition number, Smale's $γ$ and the bit-size. We also provide probabilistic bounds for random algebraic varieties under some general assumptions.
math.AG↗