The bottleneck degree of algebraic varieties
Preprint
Abstract
A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a fundamental complexity measure in the algebraic geometry of data. In this paper we study the number of bottlenecks of affine and projective varieties, which we call the bottleneck degree. The bottleneck degree is a measure of the complexity of computing all bottlenecks of an algebraic variety, using for example numerical homotopy methods. We show that the bottleneck degree is a function of classical invariants such as Chern classes and polar classes. We give the formula explicitly in low dimension and provide an algorithm to compute it in the general case.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Stability and Minimax Optimality of Tangential Delaunay Complexes for Manifold ReconstructionDiscrete & Computational Geometry, 2018
- The Euclidean Distance Degree of an Algebraic VarietyFoundations of Computational Mathematics, 2015
- Manifold Reconstruction Using Tangential Delaunay ComplexesDiscrete & Computational Geometry, 2013
- Finding the Homology of Submanifolds with High Confidence from Random SamplesDiscrete & Computational Geometry, 2008
- Random Projections of Smooth ManifoldsFoundations of Computational Mathematics, 2007
- The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective VarietiesFoundations of Computational Mathematics, 2006
- An elementary proof of a theorem of Johnson and LindenstraussRandom Structures & Algorithms, 2002
- Polar varieties and efficient real eliminationMathematische Zeitschrift, 2001
- Immersion and embedding of projective varietiesActa Mathematica, 1978
- Residual intersections and Todds formula for the double locus of a morphismActa Mathematica, 1978