The critical curvature degree of an algebraic variety

2021/04/02 by Emil Horobeţ, Horobet, Emil · 1 citation
Computer Science · Mathematics · #14Q99 #Algebra over a field #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Algebraic number #Algorithm #Computation #Curvature #Degree (music) #Dimension (graph theory) #FOS: Mathematics #Geometry #Mathematical analysis #Mathematics #Mathematics and Applications #Optimization and Control (math.OC) #Physics #Polynomial and algebraic computation #Pure mathematics #Singular point of an algebraic variety #Variety (cybernetics)

paper · pdf · doi:10.48550/arxiv.2104.01124

published in arXiv (Cornell University) (Cornell University)

openalex publication_date 2021/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Abstract

In this article, we study the complexity involved in the computation of the reach in arbitrary dimension and in particular the computation of the critical spherical curvature points of an arbitrary algebraic variety. We present properties of the critical spherical curvature points as well as an algorithm for computing it.

Cited by

• Osculating Geometry and Higher-Order Distance Loci

Related

• Critical Curvature of Algebraic Surfaces in Three-Space
• Critical Point Computations on Smooth Varieties: Degree and Complexity bounds
• Defect of Euclidean distance degree
• Curvatures at the singular points of algebraic curves and surfaces
• The Euclidean distance degree of an algebraic variety