相关论文: The Data Singular and the Data Isotropic Loci for …

We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the source curve into the target curve. A precise definition of…

There are many distance-based methods for classification and clustering, and for data with a high number of dimensions and a lower number of observations, processing distances is computationally advantageous compared to the raw data matrix.…

A bottleneck of a smooth algebraic variety $X \subset \mathbb{C}^n$ is a pair of distinct points $(x,y) \in X$ such that the Euclidean normal spaces at $x$ and $y$ contain the line spanned by $x$ and $y$. The narrowness of bottlenecks is a…

We give a positive answer to a conjecture of Aluffi-Harris on the computation of the Euclidean distance degree of a possibly singular projective variety in terms of the local Euler obstruction function.

We show that affine coordinate subspaces of dimension at least two in Euclidean space are of Khintchine type for divergence. For affine coordinate subspaces of dimension one, we prove a result which depends on the dual Diophantine type of…

A rotation in a Euclidean space V is an orthogonal map on V which acts locally as a plane rotation with some fixed angle. We give a classification of all pairs of rotations in finite-dimensional Euclidean space, up to simultaneous…

A uniformly discrete Euclidean graph is a graph embedded in a Euclidean space so that there is a minimum distance between distinct vertices. If such a graph embedded in an $n$-dimensional space is preserved under $n$ linearly independent…

In this paper, we classify the groups of semisimilarities of finite classical polar spaces with exactly two orbits on the singular or isotropic points. As a byproduct, we obtain many highly symmetric regular sets in the point graphs of…

We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

For a finite set of points $P$ in $R^d$, the function $d_P: R^d \to R^+$ measures Euclidean distance to the set $P$. We study the number of critical points of $d_P$ when $P$ is a Poisson process. In particular, we study the limit behavior…

Statistical data by their very nature are indeterminate in the sense that if one repeats the process of collecting the data the new data set will be different from the original. But two data sets generated in the same way should ``tell the…

The aim of this article is to generalize the notion of the cut locus and to get the structure theorem for it. For this purpose, we first introduce a class of 1-Lipschitz functions, each member of which is called an {\it almost distance…

Let $K$ be a bounded convex domain in $\mathbb{R}^2$ symmetric about the origin. The critical locus of $K$ is defined to be the (non-empty compact) set of lattices $\Lambda$ in $\mathbb{R}^2$ of smallest possible covolume such that $\Lambda…

Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…

Euclidean Distance Matrix (EDM), which consists of pairwise squared Euclidean distances of a given point configuration, finds many applications in modern machine learning. This paper considers the setting where only a set of anchor nodes is…

In this paper we study number fields which are Euclidean with respect to a function different from the absolute value of the norm. We also show that the Euclidean minimum with respect to weighted norms may be irrational and not isolated.

We consider an affine Euclidean lattice and record the directions of all lattice vectors of length at most $T$. Str\"ombergsson and the second author proved in [Annals of Math.~173 (2010), 1949--2033] that the distribution of gaps between…