相关论文: Euclidean distance degree of complete intersection…
We initiate a study of the Euclidean Distance Degree in the context of sparse polynomials. Specifically, we consider a hypersurface f=0 defined by a polynomial f that is general given its support, such that the support contains the origin.…
We study tropical degree bounds, stable tropical intersections, and tropical B\'ezout-type estimates through the geometry of Newton polytopes, mixed subdivisions, and lattice indices. We establish an upper bound for the tropical degree of a…
The Minkowski mixed volume of $n$ subpolytopes $D_1, \dots, D_n$ of a polytope $P \subset {\mathbb R}^n$ clearly does not exceed the normalized volume $n! \text{Vol}(P)$. Equality holds if and only if the subpolytopes are interlaced, i.e.,…
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…
This paper derives the exact cumulative density function of the distance between a randomly located node and any arbitrary reference point inside a regular $\el$-sided polygon. Using this result, we obtain the closed-form probability…
For any (real) algebraic variety $X$ in a Euclidean space $V$ endowed with a nondegenerate quadratic form $q$, we introduce a polynomial $\mathrm{EDpoly}_{X,u}(t^2)$ which, for any $u\in V$, has among its roots the distance from $u$ to $X$.…
The Euclidean distance degree of an algebraic variety is a well-studied topic in applied algebra and geometry. It has direct applications in geometric modeling, computer vision, and statistics. We use non-proper Morse theory to give a…
We study the Euclidean Distance degree of algebraic neural network models from the perspective of algebraic geometry. Focusing on shallow networks with two neurons, quadratic activation, and scalar output, we identify the associated…
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…
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…
A theorem is proved concerning approximation of analytic functions by multivariate polynomials in the $s$-dimensional hypercube. The geometric convergence rate is determined not by the usual notion of degree of a multivariate polynomial,…
We prove that there is an absolute constant $ C$ such that for every $ n \geq 2 $ and $ N\geq 10^n, $ there exists a polytope $ P_{n,N} \subset \mathbb{R}^n $ with at most $ N $ facets that satisfies…
We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…
The degree of a lattice polytope is a notion in Ehrhart theory that was studied quite intensively over the previous years. It is well-known that a lattice polytope has normalized volume one if and only if its degree is zero. Recently,…
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…
Suppose that there exists a discrete subset $X$ of a complete, connected, $n$-dimensional Riemannian manifold $M$ such that the Riemannian distances between points of $X$ correspond to the Euclidean distances of a net in $\mathbb{R}^{n}$.…
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…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
In this paper we study the problem of maximizing the distance to a given point $C_0$ over a polytope $\mathcal{P}$. Assuming that the polytope is circumscribed by a known ball we construct an intersection of balls which preserves the…