相关论文: The Computation of the Euclidean Distance Degree f…
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 analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
We completely describe the higher secant dimensions of all connected homogeneous projective varieties of dimension at most 3, in all possible equivariant embeddings. In particular, we calculate these dimensions for all Segre-Veronese…
Suppose that $X_A\subset \mathbb{P}^{n-1}$ is a toric variety of codimension two defined by an $(n-2)\times n$ integer matrix $A$, and let $B$ be a Gale dual of $A$. In this paper we compute the Euclidean distance degree and polar degrees…
In this paper we compute the dimension of all the higher secant varieties to the Segre-Veronese embedding of $\mathbb{P}^n\times \mathbb{P}^1$ via the section of the sheaf $\mathcal{O}(a,b)$ for any $n,a,b\in \mathbb{Z}^+$. We relate this…
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…
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…
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…
In this paper we develop an algebraic theory to study the problem of finding the minimum distance point from an algebraic variety with respect to the Hermitian distance function. The theory generalizes the Euclidean Distance degree…
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…
We use a double degeneration technique to calculate the dimension of the secant variety of any Segre-Veronese embedding of (P^1)^r
We study the algebraic complexity of Euclidean distance minimization from a generic tensor to a variety of rank-one tensors. The Euclidean Distance (ED) degree of the Segre-Veronese variety counts the number of complex critical points of…
In this paper we study singularities of third secant varieties of Veronese embedding $v_d(\mathbb{P}^n)$, which corresponds to the variety of symmetric tensors of border rank at most three in $(\mathbb{C}^{n+1})^{\otimes d}$.
We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…
Multiview varieties are mathematical models for the set of image feature correspondences that can be produced by a given camera arrangement. They possess an invariant known as their Euclidean distance (ED) degree, which measures the…
Given the space $V={\mathbb P}^{\binom{d+n-1}{n-1}-1}$ of forms of degree $d$ in $n$ variables, and given an integer $\ell>1$ and a partition $\lambda$ of $d=d_1+\cdots+d_r$, it is in general an open problem to obtain the dimensions of the…
A well known theorem by Alexander-Hirschowitz states that all the higher secant varieties of $V_{n,d}$ (the $d$-uple embedding of $\mathbb{P}^n$) have the expected dimension, with few known exceptions. We study here the same problem for…
We study the secant varieties of the Veronese varieties and of Veronese reembeddings of a smooth projective variety. We give some conditions, under which these secant varieties are set-theoretically cut out by determinantal equations. More…
We show that the Euclidean distance degree of a real orthogonally invariant matrix variety equals the Euclidean distance degree of its restriction to diagonal matrices. We illustrate how this result can greatly simplify calculations in…
A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…