Related papers: Low dimensional pinned distance sets via spherical…

Let $\mu$ be a Frostman measure on $E\subset\mathbb{R}^d$. The spherical average decay $$\int_{S^{d-1}}|\widehat{\mu}(r\omega)|^2\,d\omega\lesssim r^{-\beta} $$ was originally used to attack Falconer distance conjecture, via Mattila's…

We use mixed norm estimates for the spherical averaging operator to obtain some results concerning pinned distance sets.

Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances determined by $n$ points in the plane. It is shown that $\min\sum_i (d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets with minimal distance $d_1…

In this paper we provide an approximation \`a la Ambrosio-Tortorelli of some classical minimization problems involving the length of an unknown one-dimensional set, with an additional connectedness constraint, in dimension two. We introduce…

We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…

We prove a new lower bound for the number of pinned distances over finite fields: if $A$ is a sufficiently small subset of $\mathbb{F}_q^2$, then there is an element in $A$ that determines $\gg |A|^{2/3}$ distinct distances to other…

For a fixed, compactly supported probability measure $\mu$ on the $d$-dimensional space $\mathbb{R}^d$, we consider the problem of minimizing the $p^{\mathrm{th}}$-power average distance functional over all compact, connected $\Sigma…

We obtain new lower bounds on the Hausdorff dimension of distance sets and pinned distance sets of planar Borel sets of dimension slightly larger than $1$, improving recent estimates of Keleti and Shmerkin, and of Liu in this regime. In…

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

We prove that for any $E\subset{\Bbb R}^2$, $\dim_{\mathcal{H}}(E)>1$, there exists $x\in E$ such that the Hausdorff dimension of the pinned distance set $$\Delta_x(E)=\{|x-y|: y \in E\}$$ is no less than…

In this paper, we give improved bounds on the Hausdorff dimension of pinned distance sets of planar sets with dimension strictly less than one. As the planar set becomes more regular (i.e., the Hausdorff and packing dimension become…

We study the problem of how well a tree metric is able to preserve the sum of pairwise distances of an arbitrary metric. This problem is closely related to low-stretch metric embeddings and is interesting by its own flavor from the line of…

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…

The shortest distance between the first $n$ iterates of a typical point can be quantified with a log rule for some dynamical systems admitting Gibbs measures. We show this in two settings. For topologically mixing Markov shifts with at most…

Suppose $E, F$ are Borel sets in the plane, $\dim_{\mathcal{H}} E>1$, $\dim_{\mathcal{H}} E+\dim_{\mathcal{H}} F>2$, and $F$ has equal Hausdorff and packing dimension. We prove that there exists $y\in F$ such that the pinned distance set…

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…

Let $R$ be a finite valuation ring of order $q^r$ where $q$ is odd and $A$ be a subset of $R$. In the present paper, we prove that there exists a point $u$ in the Cartesian product set $A\times A\subset R^2$ such that the size of the pinned…

We study the problem of finding a triangulation T of a planar point set S such as to minimize the expected distance between two points x and y chosen uniformly at random from S. By distance we mean the length of the shortest path between x…

This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…