Related papers: Upper Bounds for $s$-Distance Subspaces
This is the first paper in a sequence on Krull dimension for limit groups, answering a question of Z. Sela. In this paper we show that strict resolutions of a fixed limit group have uniformly bounded length. The upper bound plays two roles…
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…
A finite set $X$ in the Euclidean unit sphere is called an $s$-distance set if the set of distances between any distinct two elements of $X$ has size $s$. We say that $t$ is the strength of $X$ if $X$ is a spherical $t$-design but not a…
In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the…
We Use the method of linearly independent polynomials to derive an upper bound for the cardinality of a spherical s-distance set F where the sum of distinct inner products of any two elements from F is zero. Our result generalizes the…
We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is…
In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and the Bachoc-Vallentin semidefinite programming $3$-point bound for spherical codes. An optimized implementation of this…
In this paper,based on the available mathematical works on geometry and topology of hyperbolic manifolds and discrete groups, some results of Freedman et al (hep-th/9804058) are reproduced and broadly generalized. Among many new results the…
We obtain upper bounds for the Steklov eigenvalues $\sigma_k(M)$ of a smooth, compact, connected, $n$-dimensional submanifold $M$ of Euclidean space with boundary $\Sigma$ that involve the intersection indices of $M$ and of $\Sigma$. One of…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
The present paper studies the Dirichlet spaces in balls and upper-half Euclidean spaces. As main results, we give identical characterizations of the Dirichlet norms in the respective contexts as for the classical 2-D disc case proved by…
In this paper, we investigate eigenvalues of Laplacian on a bounded domain in an $n$-dimensional Euclidean space and obtain a sharper lower bound for the sum of its eigenvalues, which gives an improvement of results due to A. D. Melas [15].…
In this paper, we initiate the study of constant dimension subspace codes restricted to Schubert varieties, which we call Schubert subspace codes. These codes have a very natural geometric description, as objects that we call intersecting…
Stochastic Approximation (SA) was introduced in the early 1950's and has been an active area of research for several decades. While the initial focus was on statistical questions, it was seen to have applications to signal processing,…
We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…
A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any two distinct points of X has size s. Larman--Rogers--Seidel proved that if the cardinality of a two-distance set…
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…