Related papers: Spectral conditions for spherical two-distance set…

A metric space $\mathrm{M}=(M;\de)$ is {\em homogeneous} if for every isometry $f$ of a finite subspace of $\mathrm{M}$ to a subspace of $\mathrm{M}$ there exists an isometry of $\mathrm{M}$ onto $\mathrm{M}$ extending $f$. A metric space…

An ordinary hypersphere of a set of points in real $d$-space, where no $d+1$ points lie on a $(d-2)$-sphere or a $(d-2)$-flat, is a hypersphere (including the degenerate case of a hyperplane) that contains exactly $d+1$ points of the set.…

According to [1] an $n$-dimensional $\mathcal{N}$--set is a compact subset $A$ of $\mathbb{R}^n$ such that for every $x$ in $\mathbb{R}^n$ there is $y$ in $A$ with $y-x$ in $\mathbb{Z}^n$. We prove that every two dimensional…

A spherical periscope in multi-dimensional space is a system of two ideal mirrors that reflect the rays emanating from a fixed point to the rays coming back to the same point, and a reversed periscope is a system of two mirrors that reflect…

A subset of a metric space is a k-distance set if there are exactly k non-zero distances occuring between points. We conjecture that a k-distance set in a d-dimensional Banach space (or Minkowski space), contains at most (k+1)^d points,…

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

We define spherical diffraction measures for a wide class of weighted point sets in commutative spaces, i.e. proper homogeneous spaces associated with Gelfand pairs. In the case of the hyperbolic plane we can interpret the spherical…

For the unit sphere S^d in Euclidean space R^(d+1), we show that for d-1<s<d and any N>1, discrete N-point minimal Riesz s-energy configurations are well separated in the sense that the minimal distance between any pair of distinct points…

A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…

We find the complete rational homology for the finite subset spaces of a $d$-dimensional sphere. We also determine the integral homology in top $d$ degrees and obtain a partial description of it in codimension $d$.

For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $2$ in the graph $G$. In this paper, for graphs $G$ with diameter 2, we show that…

For an arbitrary set of distances $D\subseteq \{0,1, \ldots, d\}$, a graph $G$ is said to be $D$-distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$,…

We prove that if two finitely generated groups act on a metrically complete 2-dimensional Euclidean building, then the distance between their fixed-point sets is realised. Our proof uses the geometry of Euclidean buildings, which we view as…

A cap in a 2-D sphere is considered, smaller than an hemisphere. Two points are randomly chosen in the cap. The probability density that the angular separation between the points have a given value is obtained. The knowledge of this…

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…

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…

A strongly regular graph with parameters $(n,d,a,c)$ is a $d$-regular graph of order $n$, in which every pair of adjacent vertices has exactly $a$ common neighbor(s) and every pair of nonadjacent vertices has exactly $c$ common neighbor(s).…

Consider finitely many points in a geodesic space. If the distance of two points is less than a fixed threshold, then we regard these two points as "near". Connecting near points with edges, we obtain a simple graph on the points, which is…

We propose a novel method for determining the radius of a spherical surface based on the distances measured between points on this surface. We consider the most general case of determining the radius when the distances are measured with…