Related papers: Maximal Equidistant Spacings

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.

We have studied the mappings that satisfy the Poletsky-type inverse inequality in the domain of the Euclidean space. It is proved that the uniform boundary of the family of such mappings is a discrete mapping. We separately considered…

A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…

We consider two disjoint sets of points. If at least one of the sets can be embedded into an Euclidean space, then we provide sufficient conditions for the two sets to be jointly embedded in one Euclidean space. In this joint Euclidean…

An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.

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…

We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets…

For arbitrary semimetric space $(X, d)$ and disjoint proximinal subsets $A$, $B$ of $X$ we define the proximinal graph as a bipartite graph with parts $A$ and $B$ whose edges $\{a, b\}$ satisfy the equality $d(a, b) = \operatorname{dist}(A,…

We formalize the notion of limit of an inverse system of metric spaces with $1$-Lipschitz projections having unbounded fibers. The purpose is to use sub-Riemannian groups for metrizing the space of signatures of rectifiable paths in…

The maximal graph Dirichlet problem asks whether there exists a spacelike graph, in a semi-Euclidean space, with a given boundary and with mean curvature everywhere zero. We prove the existence of solutions to this problem under certain…

Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…

We consider logics derived from Euclidean spaces $\mathbb{R}^n$. Each Euclidean space carries relations consisting of those pairs that are, respectively, distance more than 1 apart, distance less than 1 apart, and distance 1 apart. Each…

In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…

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 provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum…

Here we study the multipacking problems for geometric point sets with respect to their Euclidean distances. We consider a set of $n$ points $P$ and define $N_s[v]$ as the subset of $P$ that includes the $s$ nearest points of $v \in P$ and…

In this talk we show that any spherically symmetric spacetime admits locally a maximal spacelike slicing. The above condition is reduced to solve a decoupled system of first order quasi-linear partial differential equations. The solution…

Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…