Related papers: Spectral conditions for spherical two-distance set…
A finite set X in a metric space M is called an s-distance set if the set of distances between any two distinct points of X has size s. The main problem for s-distance sets is to determine the maximum cardinality of s-distance sets for…
In this paper we first prove a characterization formula for biharmonic maps in Euclidean spheres and, as an application, we construct a family of biharmonic maps from a flat $2$-dimensional torus $\mathbb{T}$ into the $3$-dimensional unit…
We study the spectral and scattering theory of light transmission in a system consisting of two asymptotically periodic waveguides, also known as one-dimensional photonic crystals, coupled by a junction. Using analyticity techniques and…
Spherical field theory is a new non-perturbative method for studying quantum field theories. It uses the spherical partial wave expansion to reduce a general d-dimensional Euclidean field theory into a set of coupled one-dimensional…
2-stratifolds are a generalization of 2-manifolds in that there are disjoint simple closed curves where several sheets meet. They arise in the study of categorical invariants of 3-manifolds and may have applications to topological data…
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…
The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…
We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…
Consider an analytic map of a neighborhood of 0 in a vector space to a Euclidean space. Suppose that this map takes all germs of lines passing through 0 to germs of circles. Such a map is called rounding. We introduce a natural equivalence…
We consider point sets in the affine plane $\mathbb{F}_q^2$ where each Euclidean distance of two points is an element of $\mathbb{F}_q$. These sets are called integral point sets and were originally defined in $m$-dimensional Euclidean…
A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…
We show that if an open set in $\mathbb{R}^d$ can be fibered by unit $n$-spheres, then $d \geq 2n+1$, and if $d = 2n+1$, then the spheres must be pairwise linked, and $n \in \left\{ 0, 1, 3, 7 \right\}$. For these values of $n$, we…
We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are…
In a given 2D space, we can have points with different levels of importance. One would prefer viewing those points from a closer/farther position per their level of importance. A point in 2D from where the user can view two given points per…
In this article, we develop a technique to "split" certain types of partially ordered sets into simpler ones and use that technique to give a partial answer to a conjecture by R. Wiegand and S. Wiegand on the structure of semi-local,…
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
A subset $S$ of vertices of a connected graph $G$ is a distance-equalizer set if for every two distinct vertices $x, y \in V (G) \setminus S$ there is a vertex $w \in S$ such that the distances from $x$ and $y$ to $w$ are the same. The…
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…
Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where…