Euclidean distance degree defect of singular projective varieties
math.AG, math.AT
Submitted: 2026-05-13
Updated: 2026-10-26
Comments: Comments are very welcome
Code: https://github.com/JoseMath/EuclideanDistanceDegree
License: http://creativecommons.org/licenses/by/4.0/
The gist: The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties.
Terminology
Abstract
The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many examples arising in optimization, engineering, statistics, and data science, there is a significant gap between them. We refer to this difference as the defect of the Euclidean distance (ED) degree. In this paper, we provide a constructible enhancement and a topological formula for the defect of the ED degree of an arbitrary complex projective variety, extending our previous results from the smooth setting. Since the generic Euclidean distance degree is typically more tractable, our approach offers a new method for computing ED degrees in broad generality.
Related papers
- K-unstable Toric Varieties and Secondary Polytopes
- The commuting scheme of g 2 and a degree formula for commuting schemes
- Stacky geometry and logarithmic topology of transversely affine foliations
- Monodromy and vanishing cycles for complete intersection curves
- Characteristic cycles and Gevrey irregularity in hypergeometric families
- Tautological classes on KSBA spaces