The Euclidean Distance Degree of an Algebraic Variety
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low-rank matrices, the Eckart–Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest point maps from the perspective of computational algebraic geometry. The Euclidean distance degree of a variety is the number of critical points of the squared distance to a general point outside the variety. Focusing on varieties seen in applications, we present numerous tools for exact computations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Introduction to Toric Varieties. (AM-131)
Fulton, W. (1993) · Princeton University Press eBooks · doi:10.1515/9781400882526 · Cited by 1,402
Fulton, W. (1998) · Springer · doi:10.1007/978-1-4612-1700-8 · Cited by 1,002
Metadata
- Authors
- Draisma, J., Horobeţ, E., Ottaviani, G., Sturmfels, B., & Thomas, R. R.
- Venue
- Foundations of Computational Mathematics
- Published
- 2015-01-06
- Volume
- 16
- Issue
- 1
- Pages
- 99-149
- ISSN
- 1615-3375 (ISSN-L)
- 1615-3383
- OpenAlex
- W2124706092
- Cited by
- 198
- References
- 2
- FWCI
- 23.96
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Euclidean Distance Degree of an Algebraic Variety. https://app.cochat.ai/papers/10.1007/s10208-014-9240-x
- The paper
- Draisma, J., Horobeţ, E., Ottaviani, G., Sturmfels, B., & Thomas, R. R. (2016). The Euclidean Distance Degree of an Algebraic Variety. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-014-9240-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.