Infinite Euclidean Distance Discriminants
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914053479202816 |
|---|---|
| author | Rydell, Felix Horobet, Emil |
| author_facet | Rydell, Felix Horobet, Emil |
| contents | We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these discriminants contain all data points with infinitely many critical points for the nearest-point problem. We present computer code that computes the infinite Euclidean distance discriminant, and use it to present numerous varieties with nonempty such discriminants. Moreover, we prove that for any data point, the fiber under the second projection is contained in a finite union of hyperspheres centered at that point. For curves, we include a complete characterization; their infinite Euclidean distance discriminants turn out to be affine linear spaces. Finally, we introduce and characterize skew-tube surfaces in three-dimensional space. By construction, these have a one-dimensional infinite Euclidean distance discriminant. We further demonstrate that many skew-tubes have significantly lower Euclidean distance degrees than generic surfaces of the same degree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_17456 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Infinite Euclidean Distance Discriminants Rydell, Felix Horobet, Emil Algebraic Geometry Differential Geometry Metric Geometry Optimization and Control 14N10, 41A65, 55R80 We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these discriminants contain all data points with infinitely many critical points for the nearest-point problem. We present computer code that computes the infinite Euclidean distance discriminant, and use it to present numerous varieties with nonempty such discriminants. Moreover, we prove that for any data point, the fiber under the second projection is contained in a finite union of hyperspheres centered at that point. For curves, we include a complete characterization; their infinite Euclidean distance discriminants turn out to be affine linear spaces. Finally, we introduce and characterize skew-tube surfaces in three-dimensional space. By construction, these have a one-dimensional infinite Euclidean distance discriminant. We further demonstrate that many skew-tubes have significantly lower Euclidean distance degrees than generic surfaces of the same degree. |
| title | Infinite Euclidean Distance Discriminants |
| topic | Algebraic Geometry Differential Geometry Metric Geometry Optimization and Control 14N10, 41A65, 55R80 |
| url | https://arxiv.org/abs/2509.17456 |