Related papers: Regular two distance sets
We study some examples when there is actually an equality in the linear algebra bound. When the vectors considered span in fact the entire space. We would like to point out that in some cases this provides some interesting extra information…
We study several interesting examples of Biangular Tight Frames (BTFs) - basis-like sets of unit vectors admitting exactly two distinct frame angles (ie, pairwise absolute inner products) - and examine their relationships with Equiangular…
We prove that a well-distributed subset of R^2 can have a separated distance set only if the distance is induced by a polygon.
A set $W\subseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,v\in V(G)$ there exists $w\in W$ such that $d(u,w)\neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum…
We propose a new embedding method for a single vector and for a pair of vectors. This embedding method enables: a) efficient classification and regression of functions of single vectors; b) efficient approximation of distance functions; and…
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.…
Let X be a 2-dimensional normed space, and let BX be the unit ball in X. We discuss the question of how large the set of extremal points of BX must be if X contains a well-distributed set whose distance set Delta satisfies the estimate…
When we represent a network of sensors in Euclidean space by a graph, there are two distances between any two nodes that we may consider. One of them is the Euclidean distance. The other is the distance between the two nodes in the graph,…
This article describes a natural piecewise Euclidean bi-simplicial cell structure for the space of $n$-element multisets in a fixed Euclidean rectangle. In particular, we highlight some connections with spaces of complex polynomials and…
Let $\mathbb{F}_q$ be a finite field of order $q$. Iosevich and Rudnev (2005) proved that for any set $A\subset \mathbb{F}_q^d$, if $|A|\gg q^{\frac{d+1}{2}}$, then the distance set $\Delta(A)$ contains a positive proportion of all…
We perform an extensive numerical analysis of $\beta$-skeleton graphs, a particular type of proximity graphs. In a $\beta$-skeleton graph (BSG) two vertices are connected if a proximity rule, that depends of the parameter…
A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular and its geometric symmetry group has index 2 in its combinatorial automorphism group; thus its automorphism group is…
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…
In this paper, a new class of Finsler metrics which are included $(\alpha,\beta)$-metrics are introduced. They are defined by a Riemannian metric and two 1-forms $\beta=b_i(x)y^i$ and $\gamma= \gamma_i(x)y^i$. This class of metrics are a…
A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…
We review the relations between distance matrices and isometric embeddings and give simple proofs that distance matrices defined on euclidean and spherical spaces have all eigenvalues except one non-negative. Several generalizations are…
Embedding graphs in a geographical or latent space, i.e.\ inferring locations for vertices in Euclidean space or on a smooth manifold or submanifold, is a common task in network analysis, statistical inference, and graph visualization. We…
A beta-skeleton is a planar proximity undirected graph of an Euclidean point set where nodes are connected by an edge if their lune-based neighborhood contains no other points of the given set. Parameter $\beta$ determines size and shape of…
In this work, the dual flatness, which is connected with Statistics and Information geometry, of general $(\alpha,\beta)$-metrics (a new class of Finsler metrics) is studied. A nice characterization for such metrics to be dually flat under…
We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…