Related papers: Constructions of Large m-Distance Sets on Triangul…
Connes' distance formula is applied to endow linear metric to three 1D lattices of different topology, with a generalization of lattice Dirac operator written down by Dimakis et al to contain a non-unitary link-variable. Geometric…
We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…
In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different…
Multidimensional scaling (MDS) is a dimensionality reduction tool used for information analysis, data visualization and manifold learning. Most MDS procedures embed data points in low-dimensional Euclidean (flat) domains, such that…
The usual Euclidean distance may be generalized to extended objects such as polymers or membranes. Here, this distance is used for the first time as a cost function to align structures. We examined the alignment of extended strands to…
The concept of $n$-distance was recently introduced to generalize the classical definition of distance to functions of $n$ arguments. In this paper we investigate this concept through a number of examples based on certain geometrical…
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.…
The minimum distance graph of an extended Preparata code P(m) has vertices corresponding to codewords and edges corresponding to pairs of codewords that are distance 6 apart. The clique structure of this graph is investigated and it is…
Distance Geometry Problem (DGP) and Nonlinear Mapping (NLM) are two well established questions: Distance Geometry Problem is about finding a Euclidean realization of an incomplete set of distances in a Euclidean space, whereas Nonlinear…
The construction of quantum error-correcting codes (QECCs) with good parameters is a hot topic in the area of quantum information and quantum computing. Quantum maximum distance separable (QMDS) codes are optimal because the minimum…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…
Laman graphs model planar frameworks that are rigid for a general choice of distances between the vertices. There are finitely many ways, up to isometries, to realize a Laman graph in the plane. Such realizations can be seen as solutions of…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
Dimension-varying linear systems are investigated. First, a dimension-free state space is proposed. A cross dimensional distance is constructed to glue vectors of different dimensions together to form a cross-dimensional topological space.…
We calculate the Gromov-Hausdorff distance between vertex sets of regular polygons endowed with the round metric. We give a full answer for the case of n- and m-gons with m divisible by n. Also, we calculate all distances to 2-gons and…
Metric graphs are meaningful objects for modeling complex structures that arise in many real-world applications, such as road networks, river systems, earthquake faults, blood vessels, and filamentary structures in galaxies. To study metric…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…
We consider various problems related to finding points in $\Q^{2}$ and in $\Q^{3}$ which lie at rational distance from the vertices of some specified geometric object, for example, a square or rectangle in $\Q^{2}$, and a cube or…
Given integers b, c, g, and n, we construct a manifold M containing a c-component link L so that there is a bridge surface Sigma for (M,L) of genus g that intersects L in 2b points and has distance at least n. More generally, given two…
In order to characterize molecular structures we introduce configurational fingerprint vectors which are counterparts of quantities used experimentally to identify structures. The Euclidean distance between the configurational fingerprint…