Related papers: Defect of Euclidean distance degree
This paper begins the exploration of what we call measures of association between two irreducible complex projective varieties of the same dimension. The idea is to study from various points of view the minimal complexity of correspondences…
The $n$-secant varieties to the Veronese embedding $v_{2n}(\mathbb{P}^{1})$ are hypersurfaces of degree $n+1$, denoted by $\sigma_n(v_{2n}(\mathbb{P}^1))$. We compute the Euclidean distance degree $\mathrm{EDdegree}$ of…
Consider a projective variety $X \subset \mathbb{P}^n$ (over an algebraically closed field of characteristic zero), together with a (reduced) simple normal crossings divisor $E \subset \mathbb{P}^n$, where the degrees of both $X$ and $E$…
This paper considers the degree-diameter problem for extremal and largest known undirected circulant graphs of degree 2 to 9 of arbitrary diameter. As these graphs are vertex transitive it is possible to define their distance partition. The…
We study the projective geometry of algebraic neural layers, namely families of maps induced by a polynomial activation function, with particular emphasis on the generic Euclidean Distance degree ($\mathrm{gED}$). This invariant is…
The generic number of critical points of the Euclidean distance function from a data point to a variety is called the Euclidean distance degree. The two special loci of the data points where the number of critical points is smaller then the…
In this paper we introduce a new invariant (the distant degree) for difference field extensions of finite transcendence degree, and we explore some of its properties. We also discuss a generalisation of this invariant and of the limit…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
This is a computational study of bottlenecks on algebraic varieties. The bottlenecks of a smooth variety $X \subseteq \mathbb{C}^n$ are the lines in $\mathbb{C}^n$ which are normal to $X$ at two distinct points. The main result is a…
Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in $\mathbb{R}^d$ ($d \geq 1$), or equivalently, distance spaces that can be isometrically…
We study the critical points over an algebraic variety of an optimization problem defined by a quadratic objective that is degenerate. This scenario arises in machine learning when the dataset size is small with respect to the model, and is…
Erd\H{o}s' unit distance problem and Erd\H{o}s' distinct distances problem are among the most classical and well-known open problems in discrete mathematics. They ask for the maximum number of unit distances, or the minimum number of…
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…
Distance metrics and their nonlinear variant play a crucial role in machine learning based real-world problem solving. We demonstrated how Euclidean and cosine distance measures differ not only theoretically but also in real-world medical…
We recall the definition of classical polar varieties, as well as those of affine and projective reciprocal polar varieties. The latter are defined with respect to a non-degenerate quadric, which gives us a notion of orthogonality. In…
We count the number of isomorphism classes of degree $d$-twists of some polarized abelian varieties over finite fields of odd prime dimension. This can be seen as a higher dimensional analogue of the counting problem for elliptic curves…
In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…
Similarity learning has received a large amount of interest and is an important tool for many scientific and industrial applications. In this framework, we wish to infer the distance (similarity) between points with respect to an arbitrary…
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…
A natural oriented (2k+2)-chain in CP^{2k+1} with boundary twice RP^{2k+1}, its complex shade, is constructed. Via intersection numbers with the shade, a new invariant, the shade number of k-dimensional subvarieties with normal vector…