Related papers: Bounds on $s$-distance sets with strength $t$
This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…
A finite set of points in $\mathbb R^d$ is called almost-equidistant if among any three distinct points in the set, some two are at unit distance. We prove that an almost-equidistant set in $\mathbb R^d$ has cardinality at most $5d^{13/9}$.
An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…
A finite metric space is called here distance degree regular if its distance degree sequence is the same for every vertex. A notion of designs in such spaces is introduced that generalizes that of designs in $Q$-polynomial distance-regular…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
As a generalization of equiangular lines, equiangular subspaces were first systematically studied by Balla, Dr\"{a}xler, Keevash and Sudakov in 2017. In this paper, we extend their work to $s$-distance subspaces, i.e., to sets of…
The study of intersection problems on families of sets is one of the most important topics in extremal combinatorics. As we all know, the extremal problems involving certain intersection constraints are equivalent to that with the union…
A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…
In this paper, we study the cardinality of the distance set $\Delta(A, B)$ determined by two subsets $A$ and $B$ of the $d$-dimensional vector space over a finite field $\mathbb{F}_q$. Assuming that $A$ or $B$ lies in a $k$-coordinate plane…
Let $(X,d,\mu)$ be a space of homogeneous type. In this note we study the relationship between two types of $s$-sets: relative to a distance and relative to a measure. We find a condition on a closed subset $F$ of $X$ under which we have…
The outer multiset dimension ${\rm dim}_{\rm ms}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that…
The group $\text{Diff}(\mathcal{M})$ of diffeomorphisms of a closed manifold $\mathcal{M}$ is naturally equipped with various right-invariant Sobolev norms $W^{s,p}$. Recent work showed that for sufficiently weak norms, the geodesic…
A well-known theorem of Sch\"utte (1963) gives a sharp lower bound for the ratio between the maximum distance and minimum distance between n+2 points in n-dimensional Euclidean space. In this brief note we adapt B\'ar\'any's elegant proof…
Let \( D \) be a strongly connected digraph. The average distance of a vertex \( v \) in \( D \) is defined as the arithmetic mean of the distances from \( v \) to all other vertices in \( D \). The remoteness \( \rho(D) \) of \( D \) is…
A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the…
We derive upper bounds for the potential energy of spherical designs of cardinality close to the Delsarte-Goethals-Seidel bound. These bounds are obtained by linear programming with the use of the Hermite interpolating polynomial of the…
We prove the following three statements: 1) Let $(A, \bar A)$ be a partition of the spherical surface $S^n$ into two measurable sets. Let $st_A$ and $st_{\bar A}$ be their measure density functions of distance. Then $|st_A - st_{\bar A}|$…