Related papers: A multi-parameter variant of the Erd\H{o}s distanc…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

This paper introduces the \emph{$d$-distance $b$-matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges, an integer $d\in\mathbb{Z}_+$ and a degree bound function…

For a set $E \subseteq \mathbb{F}_q^d$, the distance set is defined as $\Delta(E) := \{\|\mathbf{x} - \mathbf{y}\| : \mathbf{x}, \mathbf{y} \in E\}$, where $\|\cdot\|$ denotes the standard quadratic form. We investigate the…

In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \leq k \leq \binom{n}{2}$, the…

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in $\mathbb{R}^d$ ($d \geq 1$), or equivalently, distance spaces that can be isometrically…

We consider the series expansion of the $L^p$-Hardy inequality of \cite{BFT2}, in the particular case where the distance is taken from an interior point of a bounded domain in $\mathbb{R}^n$ and $1<p\neq n$. For $p<n$ we improve it by…

We study variants of the Erd\H os distance problem and dot products problem in the setting of the integers modulo $q$, where $q = p^{\ell}$ is a power of an odd prime.

We introduce a concept called refinement and develop two different ways of refining metrics. By applying these methods we produce several refinements of the shortest-path distance on the collaboration graph and hence a couple new versions…

In this work, the problem of shape optimization, subject to PDE constraints, is reformulated as an $L^p$ best approximation problem under divergence constraints to the shape tensor introduced in Laurain and Sturm: ESAIM Math. Model. Numer.…

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is large odd prime power. In this paper, we improve some recent results on the additive energy of the distance set, and on sumsets of the distance set due to Shparlinski (2016).…

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

In this article, we consider the Euclidean dispersion problems. Let $P=\{p_{1}, p_{2}, \ldots, p_{n}\}$ be a set of $n$ points in $\mathbb{R}^2$. For each point $p \in P$ and $S \subseteq P$, we define $cost_{\gamma}(p,S)$ as the sum of…

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 show improved fine-grained hardness of two key lattice problems in the $\ell_p$ norm: Bounded Distance Decoding to within an $\alpha$ factor of the minimum distance ($\mathrm{BDD}_{p, \alpha}$) and the (decisional) $\gamma$-approximate…

We study an extension of the Falconer distance problem in the multiparameter setting. Given $\ell\geq 1$ and $\mathbb{R}^{d}=\mathbb{R}^{d_1}\times\cdots \times\mathbb{R}^{d_\ell}$, $d_i\geq 2$. For any compact set $E\subset \mathbb{R}^{d}$…

The problem of determining the configuration of points from partial distance information, known as the Euclidean Distance Geometry (EDG) problem, is fundamental to many tasks in the applied sciences. In this paper, we propose two algorithms…

We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…

In this paper, we prove that a set of $N$ points in ${\bf R}^2$ has at least $c{N \over \log N}$ distinct distances, thus obtaining the sharp exponent in a problem of Erd\"os. We follow the set-up of Elekes and Sharir which, in the spirit…

A celebrated result due to Wolff says if $E$ is a compact subset of ${\Bbb R}^2$, then the Lebesgue measure of the distance set $\Delta(E)=\{|x-y|: x,y \in E \}$ is positive if the Hausdorff dimension of $E$ is greater than $\frac{4}{3}$.…