Related papers: Maximal Equidistant Spacings

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

Let $X=G/K$ be a higher rank symmetric space of non-compact type, where $G$ is the connected component of the isometry group of $X$. We define the splitting rank of $X$, denoted by $\text{srk}(X)$, to be the maximal dimension of a totally…

A comprehensive approach to Sobolev-type embeddings, involving arbitrary rearrangement- invariant norms on the entire Euclidean space R^n, is offered. In particular, the optimal target space in any such embedding is exhibited. Crucial in…

Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…

Let $G$ be a locally compact group. Then for every $G$-space $X$ the maximal $G$-proximity $\beta_G$ can be characterized by the maximal topological proximity $\beta$ as follows: $$ A \ \overline{\beta_G} \ B \Leftrightarrow \exists V \in…

A point $p$ is said to be an area center of a polygon if all of the triangles composed of $p$ and its edges have one and the same area. We construct a moduli space $AC_n$ of such $n$-gons and study its geometry and arithmetic. For every…

Metric spaces satisfying properties stronger than completeness and weaker than compactness have been studied by many authors over the years. One such significant family is that of cofinally complete metric spaces. We discuss the…

Kusner asked if $n+1$ points is the maximum number of points in $\mathbb{R}^n$ such that the $\ell_p$ distance $(1<p<\infty)$ between any two points is $1$. We present an improvement to the best known upper bound when $p$ is large in terms…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…

We describe and study the loci equidistant from finitely many points in the so-called complex hyperbolic geometry, i.e., in the geometry of a holomorphic $2$-ball $\Bbb B$. In particular, we show that the bisectors (= the loci equidistant…

We investigate the use of Minimax distances to extract in a nonparametric way the features that capture the unknown underlying patterns and structures in the data. We develop a general-purpose and computationally efficient framework to…

In the present article we introduce and study a class of topological reflection spaces that we call Kac-Moody symmetric spaces. These generalize Riemannian symmetric spaces of non-compact type. We observe that in a non-spherical Kac-Moody…

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…

The farthest point map sends a point in a compact metric space to the set of points farthest from it. We focus on the case when this metric space is a convex centrally symmetric polyhedron, so that we can compose the farthest point map with…

Many statistical and machine learning approaches rely on pairwise distances between data points. The choice of distance metric has a fundamental impact on performance of these procedures, raising questions about how to appropriately…

We use representation theory to construct spaces of matrices of constant rank. These spaces are parametrized by the natural representation of the general linear group or the symplectic group. We present variants of this idea, with more…

We recall the definition of an r-maximal set in a metric space as a maximal subset of diameter r. In the special case when the metric space is Euclidean such a set is exactly a solid of constant diameter r. In the process of reviewing the…

We give an explicit classification of maximal antipodal sets in any irreducible compact symmetric space except for spin groups and half spin groups, and some quotient symmetric spaces associated to them.

Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…

Let X be a symmetric space of non-compact type or a locally finite, strongly transitive Euclidean building, and let B denote the geodesic boundary of X. We reduce the study of visual limits of maximal flats in X to the study of limits of…