Related papers: Distribution of distances in five dimensions and r…

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…

Using Monte-Carlo methods, we determine the best-fit value of the homogeneity parameter alpha in the Dyer-Roeder distance-redshift relation for a variety of redshifts, inhomogeneity models and cosmological parameter values. The relation…

Let $P$ be a finite point set in $\mathbb{R}^2$ with the set of distance $n$-chains defined as $$ \Delta_n(P)=\{(|p_1-p_2|,|p_2-p_3|,\ldots,|p_n-p_{n+1}|):p_i \in P\}.$$ We show that for $2\leq n=O_{|P|}(1)$ we have $$|\Delta_n(P)|\gtrsim…

Given a family $\mathcal{F}=\{A_1,\dots,A_s\}$ of subsets of $\mathbb{Z}_n$, define $\Delta \mathcal{F}$ to be the multiset of all (cyclic) distances dist$(x,y)$, where $\{x,y\} \subset A_i$, $x \neq y$, for some $i=1,\dots,s$. Taking…

In this paper we prove some results on sum-product estimates over arbitrary finite fields. More precisely, we show that for sufficiently small sets $A\subset \mathbb{F}_q$ we have \[|(A-A)^2+(A-A)^2|\gg |A|^{1+\frac{1}{21}}.\] This can be…

Given two distributions $\mathcal{P}$ and $\mathcal{Q}$ over a high-dimensional domain $\{0,1\}^n$, and a parameter $\varepsilon$, the goal of distance estimation is to determine the statistical distance between $\mathcal{P}$ and…

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold $\alpha>0$ such that $|\Delta(E)| \gtrsim q$ whenever $|E| \gtrsim q^{\alpha}$, where $E \subset {\Bbb F}_q^d$, the $d$-dimensional vector…

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

In 1997, Erd\H{o}s asked whether for arbitrarily large $n$ there exists a set of $n$ points in $\mathbb{R}^2$ that determines $O(\frac{n}{\sqrt{\log n}})$ distinct distances while satisfying the local constraint that every 4-point subset…

We prove a version of the Erd\H{o}s--Beck Theorem from discrete geometry for fractal sets in all dimensions. More precisely, let $X\subset \mathbb{R}^n$ Borel and $k \in [0, n-1]$ be an integer. Let $\dim (X \setminus H) = \dim X$ for every…

Let $p$ be a prime integer, $1\leq s\leq r$ integers, $F$ a field of characteristic $p$. Let $\cat{Dec}_{p^r}$ denote the class of the tensor product of $r$ $p$-symbols and $\cat{Alg}_{p^r,p^s}$ denote the class of central simple algebras…

It is widely believed that point sets in the plane which determine few distinct distances must have some special structure. In particular, such sets are believed to be similar to a lattice. This note considers two different ways to quantify…

The first purpose of this paper is to provide new finite field extension theorems for paraboloids and spheres. By using the unusual good Fourier transform of the zero sphere in some specific dimensions, which has been discovered recently in…

Utilising recent advances in incidence geometry for balls and tubes, and advances in sum-product theory in the discrete setting, we show that for $0 < s \leq 1/2$ and for any $A \subset \mathbb{R}$ with Hausdorff dimension $s$, either the…

The famous Erd\H{o}s distinct distances problem asks the following: how many distinct distances must exist between a set of $n$ points in the plane? There are many generalisations of this question that ask one to consider different spaces…

We continue the study of $\delta$-dispersion, a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many…

A celebrated unit distance conjecture due to Erd\H os says that that the unit distances cannot arise more than $C_{\epsilon}n^{1+\epsilon}$ times (for any $\epsilon>0$) among $n$ points in the Euclidean plane (see e.g. \cite{SST84} and the…

Let \({\mathbb K}\) be any field, let \(X\subset {\mathbb P}^{k-1}\) be a set of \(n\) distinct \({\mathbb K}\)-rational points, and let \(a\geq 1\) be an integer. In this paper we find lower bounds for the minimum distance \(d(X)_a\) of…

Let $S \subset {\mathbb R}^d$ be contained in the unit ball. Let $\Delta(S)=\{||a-b||:a,b \in S\}$, the Euclidean distance set of $S$. Falconer conjectured that the $\Delta(S)$ has positive Lebesque measure if the Hausdorff dimension of $S$…

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…