English
Related papers

Related papers: On sets with few distinct distances

200 papers

Given a point (the "spider") on a rectangular box, we would like to find the minimal distance along the surface to its opposite point (the "fly" - the reflection of the spider across the center of the box). Without loss of generality, we…

Differential Geometry · Mathematics 2015-02-05 S. Michael Miller , Edward F. Schaefer

It is shown that the number of distinct types of three-point hinges, defined by a real plane set of $n$ points is $\gg n^2\log^{-3} n$, where a hinge is identified by fixing two pair-wise distances in a point triple. This is achieved via…

Combinatorics · Mathematics 2020-03-12 Misha Rudnev

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov

The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…

Computational Geometry · Computer Science 2022-06-14 Henry L. Fleischmann , Sergei V. Konyagin , Steven J. Miller , Eyvindur A. Palsson , Ethan Pesikoff , Charles Wolf

One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…

General Mathematics · Mathematics 2023-11-27 Daniel Cao Labora

In designing a network to link n cities in a square of area n, one might be guided by the following two desiderata. First, the total network length should not be much greater than the length of the shortest network connecting all cities.…

Probability · Mathematics 2007-11-26 David J. Aldous , Wilfrid S. Kendall

We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…

Combinatorics · Mathematics 2026-05-21 Stefan Felsner , Jędrzej Hodor , Giacomo Ortali , Alexander Wolff

Let N, N' and N'' be point processes such that N' is obtained from N by homogeneous independent thinning and N''= N- N'. We give a new elementary proof that N' and N'' are independent if and only if N is a Poisson point process. We present…

Probability · Mathematics 2011-11-10 Renato M. Assuncao , Pablo A. Ferrari

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

We prove that if $N$ points lie in convex position in the plane then they determine $\Omega(N^{5/4})$ distinct angles, provided that the points do not lie on a common circle. This is derived from a more general claim that if $N$ points in…

Combinatorics · Mathematics 2025-10-14 Sergei V. Konyagin , Jonathan Passant , Misha Rudnev

For any cofinite Fuchsian group $\Gamma\subset {\rm PSL}(2, \mathbb{R})$, we show that any set of $N$ points on the hyperbolic surface $\Gamma\backslash\mathbb{H}^2$ determines $\geq C_{\Gamma} \frac{N}{\log N}$ distinct distances for some…

Number Theory · Mathematics 2020-08-05 Xianchang Meng

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 shall give a short proof of the result originally obtained by Ashutosh Kumar that for each $A\subset \mathbb{R}$ there exists $B\subset A$ full in $A$ such that no distance between two distinct points from $B$ is rational.…

General Topology · Mathematics 2019-07-23 Marcin Michalski

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

Rings and Algebras · Mathematics 2021-06-17 Aiping Gan , Li Guo

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…

Combinatorics · Mathematics 2011-07-26 Norbert Sauer

We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$…

Combinatorics · Mathematics 2022-05-05 Brendan Murphy , Giorgis Petridis , Thang Pham , Misha Rudnev , Sophie Stevens

Two Delone sets are bounded distance equivalent to each other if there is a bijection between them such that the distance of corresponding points is uniformly bounded. Bounded distance equivalence is an equivalence relation. We show that…

Dynamical Systems · Mathematics 2021-11-09 Dirk Frettlöh , Alexey Garber , Lorenzo Sadun

In the present paper we investigate geometric characteristics of compact metric spaces, which can be described in terms of Gromov-Hausdorff distances to simplexes, i.e., to finite metric spaces such that all their nonzero distances are…

Metric Geometry · Mathematics 2016-07-25 Alexander O. Ivanov , Alexey A. Tuzhilin

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin