The bottleneck degree of algebraic varieties

From MaRDI portal
Publication:4959845

DOI10.1137/19M1265776zbMATH Open1505.14122arXiv1904.04502WikidataQ114615464 ScholiaQ114615464MaRDI QIDQ4959845FDOQ4959845


Authors: Sandra Di Rocco, David Eklund, Madeleine Weinstein Edit this on Wikidata


Publication date: 7 April 2020

Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Abstract: A bottleneck of a smooth algebraic variety XsubsetmathbbCn is a pair of distinct points (x,y)inX 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.


Full work available at URL: https://arxiv.org/abs/1904.04502




Recommendations




Cites Work


Cited In (9)

Uses Software





This page was built for publication: The bottleneck degree of algebraic varieties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959845)