English
Related papers

Related papers: Bounds on two-distance sets in Euclidean space and…

200 papers

We study the Falconer distance set problem in Euclidean space and obtain improved dimensional estimates under natural Fourier analytic assumptions cast in terms of the Fourier dimension and spectrum. Interestingly, under reasonably mild…

Classical Analysis and ODEs · Mathematics 2026-04-22 Jonathan M. Fraser , Thang Pham

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

Combinatorics · Mathematics 2016-08-19 Aida Abiad , Sebastian Cioabă , Michael Tait

We investigate the question of sharp upper bounds for the Steklov eigenvalues of a hypersurface of revolution of the Euclidean space with two boundary components isometric to two copies of $\mathbb{S}^{n-1}$. For the case of the first non…

Differential Geometry · Mathematics 2024-10-15 Léonard Tschanz

Finding the maximum cardinality of a $2$-distance set in Euclidean space is a classical problem in geometry. Lison\v{e}k in 1997 constructed a maximum $2$-distance set in $\mathbb R^8$ with $45$ points. That $2$-distance set constructed by…

Combinatorics · Mathematics 2022-11-07 Eiichi Bannai , Etsuko Bannai , Chin-Yen Lee , Ziqing Xiang , Wei-Hsuan Yu

The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…

Information Theory · Computer Science 2019-06-25 P. Boyvalenkov , K. Delchev , D. Zinoviev , V. Zinoviev

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…

Metric Geometry · Mathematics 2019-08-15 Konrad J. Swanepoel

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…

Combinatorics · Mathematics 2026-05-21 Will Sawin

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…

Combinatorics · Mathematics 2025-06-10 Hunseok Kang , Doowon Koh , Firdavs Rakhmonov

We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…

Combinatorics · Mathematics 2026-02-10 Víctor Hugo Almendra-Hernández , Leonardo Martínez-Sandoval

Given a large finite point set, $P\subset \mathbb R^2$, we obtain upper bounds on the number of triples of points that determine a given pair of dot products. That is, for any pair of positive real numbers, $(\alpha, \beta)$, we bound the…

Combinatorics · Mathematics 2015-02-09 Daniel Barker , Steven Senger

A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all…

Metric Geometry · Mathematics 2020-09-29 Hiroshi Nozaki , Masashi Shinohara

In a previous article the authors determined the best-known upper bound for the cardinality of the image set for several classes of functions, including planar functions. Here, we show that the upper bound cannot be tight for planar…

Combinatorics · Mathematics 2026-01-05 Robert Coulter , Steven Senger

Let $(s_2(n))_{n=0}^\infty$ denote Stern's diatomic sequence. For $n\geq 2$, we may view $s_2(n)$ as the number of partitions of $n-1$ into powers of $2$ with each part occurring at most twice. More generally, for integers $b,n\geq 2$, let…

Combinatorics · Mathematics 2015-06-26 Colin Defant

The purpose of this paper is to establish an upper bound on the distance between two pants decompositions in the pants complex for a closed surface of genus g >= 2. This is done by use of graph theory. First distance is found in the pants…

Geometric Topology · Mathematics 2012-05-03 Harriet H. Moser

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

Metric Geometry · Mathematics 2016-10-24 Kyle Kinneberg

Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…

Metric Geometry · Mathematics 2018-05-22 Ilya Dumer

We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki , Makoto Tagami

We consider point sets in the $m$-dimensional affine space $\mathbb{F}_q^m$ where each squared Euclidean distance of two points is a square in $\mathbb{F}_q$. It turns out that the situation in $\mathbb{F}_q^m$ is rather similar to the one…

Combinatorics · Mathematics 2014-01-20 Sascha Kurz , Harald Meyer

We obtain several new results contributing to the theory of real equiangular line systems. Among other things, we present a new general lower bound on the maximum number of equiangular lines in d dimensional Euclidean space; we describe the…

Combinatorics · Mathematics 2016-05-03 G. Greaves , J. H. Koolen , A. Munemasa , F. Szöllősi

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

Computational Geometry · Computer Science 2019-05-08 Mahdi Imanparast , Seyed Naser Hashemi , Ali Mohades