The Euclidean Distance Degree of Fermat Hypersurfaces
Not on the map. Why?
Abstract (arXiv)
Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a piecewise polynomial whose pieces are defined by subtle congruence conditons.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 2 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Robustness Verification of Polynomial Neural Networkscited by 3
- 2026Robustness Verification of Polynomial Neural Networks5 Feb 2026