Computing Geometric Feature Sizes for Algebraic Manifolds

DOI10.1137/22M1522656MaRDI QIDQ6066752zbMATH OpenOpenAlexFDO

Authors Sandra Di Rocco, Parker B. Edwards, David Eklund, Oliver Gäfvert, Jonathan D. Hauenstein

Publication date 13 December 2023

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

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

zbMATH Keywords

bottlenecksnumerical algebraic geometryreachtopological data analysisweak feature size

Mathematics Subject Classification ID

Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Persistent homology and applications, topological data analysis (55N31)

Abstract: We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining polynomials as input. For the weak feature size, we also show that non-quadratic complete intersections generically have finitely many geometric bottlenecks, and describe how to compute the weak feature size directly rather than a lower bound in this case. In all other cases, we describe additional computations that can be used to determine feature size values rather than lower bounds. We also present homology inference experiments that combine persistent homology computations with implemented versions of our feature size algorithms, both with globally dense samples and samples that are adaptively dense with respect to the local feature size.

Recommendations

• The numerical algebraic geometry of bottlenecks
• The critical curvature degree of an algebraic variety
• AN ALGEBRAIC TOPOLOGICAL METHOD FOR FEATURE IDENTIFICATION
• The bottleneck degree of algebraic varieties
• Computable bounds for the reach and \(r\)-convexity of subsets of \({{\mathbb{R}}}^d\)

Cites work

• A generalized sphere theorem
• A sampling theory for compact sets in Euclidean space
• Barcodes: The persistent topology of data
• Coefficient-parameter polynomial continuation
• Computing the first few Betti numbers of semi-algebraic sets in single exponential time
• Computing the homology of basic semialgebraic sets in weak exponential time
• Curvature Measures
• Distance functions, critical points, and the topology of random Čech complexes
• Estimating the reach of a manifold
• Finding the homology of submanifolds with high confidence from random samples
• Geometric and combinatorial properties of well-centered triangulations in three and higher dimensions
• Homotopy techniques for tensor decomposition and perfect identifiability
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• scientific article; zbMATH DE number 431694 (Why is no real title available?)
• scientific article; zbMATH DE number 3016238 (Why is no real title available?)
• scientific article; zbMATH DE number 773851 (Why is no real title available?)
• scientific article; zbMATH DE number 3208810 (Why is no real title available?)
• scientific article; zbMATH DE number 7760183 (Why is no real title available?)
• Matrices and graphs in geometry
• Morse theory for min-type functions
• Morse Theory. (AM-51)
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Numerically computing real points on algebraic sets
• Numerically solving polynomial systems with Bertini
• Offset hypersurfaces and persistent homology of algebraic varieties
• Recovering exact results from inexact numerical data in algebraic geometry
• Regeneration homotopies for solving systems of polynomials
• Regenerative cascade homotopies for solving polynomial systems
• Sampling and homology via bottlenecks
• Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
• Some theorems on absolute neighborhood retracts
• Stability of persistence diagrams
• Surface reconstruction by Voronoi filtering
• Symmetric homotopy construction
• The bottleneck degree of algebraic varieties
• The critical curvature degree of an algebraic variety
• The measure of the critical values of differentiable maps
• The numerical algebraic geometry of bottlenecks
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Topology and data
• Tubular neighborhoods in Euclidean spaces
• Vietoris-Rips complexes also provide topologically correct reconstructions of sampled shapes
• Weak feature size and persistent homology: computing homology of solids in \(\mathbb{R}^n\) from noisy data samples

Cited in

(3)

• Interpolation in weighted projective spaces
• Some lower bounds on the reach of an algebraic variety
• Covering number of real algebraic varieties and beyond: improved bounds and applications

This page was built for publication: Computing Geometric Feature Sizes for Algebraic Manifolds

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