Related papers: The Data Singular and the Data Isotropic Loci for …
The manifold hypothesis, which assumes that data lies on or close to an unknown manifold of low intrinsic dimension, is a staple of modern machine learning research. However, recent work has shown that real-world data exhibits distinct…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
We consider the Keplerian distance $d$ in the case of two elliptic orbits, i.e. the distance between one point on the first ellipse and one point on the second one, assuming they have a common focus. The absolute minimum $d_{\rm min}$ of…
For all 0<t \leq 1, we define a locally Euclidean metric \rho_t on R^3. These metrics are invariant under Euclidean isometries and, if t increases to 1, converges to the Euclidean metric d_E. This research is motivated by expanding…
We consider the system of $N$ points on the segment of the real line with the nearest-neighbor Coulomb repulsive interaction and external force $F$. For the fixed points of such systems (fixed configurations) we study the asymptotics (in…
A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…
Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…
We consider in this paper discrete improper affine spheres based on asymptotic nets. In this context, we distinguish the discrete edges and vertices that must be considered singular. The singular edges can be considered as discrete cuspidal…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
The thesis deals with recognizing diffeomorphisms from fractal properties of discrete orbits, generated by iterations of such diffeomorphisms. The notion of fractal properties of a set refers to the box dimension, the Minkowski content and…
For any constant $d$ and parameter $\varepsilon > 0$, we show the existence of (roughly) $1/\varepsilon^d$ orderings on the unit cube $[0,1)^d$, such that any two points $p,q\in [0,1)^d$ that are close together under the Euclidean metric…
For pattern recognition like image recognition, it has become clear that each machine-learning dictionary data actually became data in probability space belonging to Euclidean space. However, the distances in the Euclidean space and the…
Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…
In this note, we consider two types of estimates for the Harnack distance in bounded domains of a finite-dimensional Euclidean space. The first type is based on the geometric concept of the entropy of arcwise connectedness. We used this…
Oda's problem, which deals with the fixed field of the universal monodromy representation of moduli spaces of curves and its independence with respect to the topological data, is a central question of anabelian arithmetic geometry. This…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
We completely classify all plane curves of degree at most 30 with a unique cuspidal (locally unibranch) singular point and rational normalization in terms of the Newton pairs parameterizing the cusp. We distinguish between prime and…
We show that any asymptotically locally Euclidean (ALE) metric which is obstruction-flat or extended obstruction-flat must be ALE of a certain optimal order. Moreover, our proof applies to very general elliptic systems and in any dimension…
We call a simple abelian variety over $\mathbb{F}_p$ super-isolated if its ($\mathbb{F}_p$-rational) isogeny class contains no other varieties. The motivation for considering these varieties comes from concerns about isogeny based attacks…
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…