相关论文: The Data Singular and the Data Isotropic Loci for …
We introduce a theory of relative tangency for projective algebraic varieties. The dual variety $X_Z^\vee$ of a variety $X$ relative to a subvariety $Z$ is the set of hyperplanes tangent to $X$ at a point of $Z$. We also introduce the…
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…
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…
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…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…
In many areas of applied mathematics and statistics, it is a fundamental problem to find the best representative of a model by optimizing an objective function. This can be done by determining critical points of the objective function…
Our study concerns the Euclidean distance function in case of complex plane curves. We decompose the ED discriminant into components which are responsible for three types of behavior of the Morse points. Besides the traditional focal…
In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…
The critical loci of a map $f:X\to Y$ between smooth schemes over a field $k$ are the locally closed subschemes $\Sigma^i(f)\subseteq X$ where the differential of $f$ has constant rank. We prove that if $f : X\to \mathbb A^r$ is the general…
Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to…
Data uniformity is a concept associated with several semantic data characteristics such as lack of features, correlation and sample bias. This article introduces a novel measure to assess data uniformity and detect uniform pointsets on…
We discuss the problem of optimizing the distance function from a given point, subject to polynomial constraints. A key algebraic invariant that governs its complexity is the Euclidean distance degree, which pertains to first-order…
We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely…
We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the $A$-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable…
We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means…
The multiple root loci among univariate polynomials of degree $n$ are indexed by partitions of $n$. We study these loci and their conormal varieties. The projectively dual varieties are joins of such loci where the partitions are hooks. Our…
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several applications where the input data consists of an incomplete set of distances, and the output is a set of points in…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…
For a smooth surface in $\mathbb{R}^3$ this article contains local study of certain affine equidistants, that is loci of points at a fixed ratio between points of contact of parallel tangent planes (but excluding ratios 0 and 1 where the…
A non-equilateral triangle in a Euclidean plane has exactly two isogonic and two isodynamic points. There are a number of different but equivalent characterizations of these triangle centers. The aim of this paper is to work out…