The bottleneck degree of algebraic varieties

DOI10.1137/19M1265776MaRDI QIDQ4959845zbMATHWikidataFDO

Authors Sandra Di Rocco, David Eklund, Madeleine Weinstein

Publication date 7 April 2020

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

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

zbMATH Keywords

manifold learningbottleneckreachpolar classes

Mathematics Subject Classification ID

Computational learning theory (68Q32) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Abstract: A bottleneck of a smooth algebraic variety $Xsubsetmathbb{C}^n$ 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.

Recommendations

• The numerical algebraic geometry of bottlenecks
• Sampling and homology via bottlenecks
• On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
• Defect of Euclidean distance degree
• On the geometry of polar varieties

Cites work

• scientific article; zbMATH DE number 3968786 (Why is no real title available?)
• scientific article; zbMATH DE number 1339029 (Why is no real title available?)
• scientific article; zbMATH DE number 1027930 (Why is no real title available?)
• scientific article; zbMATH DE number 1827070 (Why is no real title available?)
• scientific article; zbMATH DE number 2221424 (Why is no real title available?)
• 3264 and all that. A second course in algebraic geometry
• A method to compute Segre classes of subschemes of projective space
• A nonparametric approach to the estimation of lengths and surface areas
• An elementary proof of a theorem of Johnson and Lindenstrauss
• An introduction to polynomial and semi-algebraic optimization
• Chern numbers of smooth varieties via homotopy continuation and intersection theory
• Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
• Computing intersection numbers of Chern classes
• Critical point computations on smooth varieties, degree and complexity bounds
• Curvature Measures
• Estimating the reach of a manifold
• Finding the homology of submanifolds with high confidence from random samples
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Immersion and embedding of projective varieties
• Learning algebraic varieties from samples
• Manifold reconstruction using tangential Delaunay complexes
• Minimax estimation of the volume of a set under the rolling ball condition
• Minimax manifold estimation
• Numerical algebraic geometry and algebraic kinematics
• Numerical polar calculus and cohomology of line bundles
• Numerically solving polynomial systems with Bertini
• Polar classes of singular varieties
• Polar varieties and efficient real elimination
• Polar varieties revisited
• Provably good sampling and meshing of surfaces
• Random projections of smooth manifolds
• Residual intersections and Todd's formula for the double locus of a morphism
• Stability and minimax optimality of tangential Delaunay complexes for manifold reconstruction
• The Euclidean distance degree of an algebraic variety
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The bottleneck degree of algebraic varieties
• The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties
• The maximal number of regular totally mixed Nash equilibria
• The numerical algebraic geometry of bottlenecks
• Tight minimax rates for manifold estimation under Hausdorff loss
• Tighter bounds for random projections of manifolds
• Triangulating smooth submanifolds with light scaffolding

Cited in

(10)

• Logarithmic Voronoi cells for Gaussian models
• Linear optimization on varieties and Chern-Mather classes
• Computing Geometric Feature Sizes for Algebraic Manifolds
• Voronoi cells of varieties
• Sampling and homology via bottlenecks
• The degree of a Severi variety
• The numerical algebraic geometry of bottlenecks
• The bottleneck degree of algebraic varieties
• Voronoi cells in metric algebraic geometry of plane curves
• The critical curvature degree of an algebraic variety

Describes a project that uses

Uses Software

• Macaulay2
• Bertini
• Schubert2
• HomotopyContinuation
• LearningAlgebraicVarieties
• Book3264Examples
• GitHub

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)