Related papers: A new perspective on the distance problem over pri…
Let $\mathbb{F}$ be a field, let $P \subseteq \mathbb{F}^d$ be a finite set of points, and let $\alpha,\beta \in \mathbb{F} \setminus \{0\}$. We study the quantity \[|\Pi_{\alpha, \beta}| = \{(p,q,r) \in P \times P \times P \mid p \cdot q =…
In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…
We study a variant of Erd\H os' unit distance problem, concerning dot products between successive pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, and a sequence of nonzero dot…
If $S$ is a given regular $d$-simplex of edge length $a$ in the $d$-dimensional Euclidean space $\mathcal{E}$, then the distances $t_1$, $\cdots$, $t_{d+1}$ of an arbitrary point in $\mathcal{E}$ to the vertices of $S$ are related by the…
Guth and Katz proved that any point set $\mathcal P$ in the plane determines $\Omega(|\mathcal P|/\log|\mathcal P|)$ distinct distances. We show that when near to this lower bound, a point set $\mathcal P$ of the form $A\times A$ must…
A Euclidean distance matrix $D(\alpha)$ is defined by $D_{ij}=(\alpha_i-\alpha_j)^2$, where $\alpha=(\alpha_1,\ldots,\alpha_n)$ is a real vector. We prove that $D(\alpha)$ cannot be written as a sum of $\left[2\sqrt{n}-2\right]$ nonnegative…
We begin by revisiting a paper of Erd\H{o}s and Fishburn, which posed the following question: given $k\in \mathbb{N}$, what is the maximum number of points in a plane that determine at most $k$ distinct distances, and can such optimal…
We develop quantitative algorithmic information bounds for orthogonal projections and distances in the plane. Under mild independence conditions, the distance $|x-y|$ and a projection coordinate $p_e x$ each retain at least half the…
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the distance to finite chains may or may not coincide with the…
In this work we prove that the set of the difference of primes is a $\Delta_r^*$-set. The work is based on the recent dramatic new developments in the study of bounded gaps between primes, reached by Zhang, Maynard and Tao.
Causal set theory is perhaps the most minimalistic approach to quantum gravity, in the sense that it makes next to zero assumptions about the structure of spacetime below the Planck scale. Yet even with this minimalism, the continuum limit…
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…
Optimal transport and its related problems, including optimal partial transport, have proven to be valuable tools in machine learning for computing meaningful distances between probability or positive measures. This success has led to a…
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 study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…
The recent years have seen a beautiful breakthrough culminating in a comprehensive understanding of certain scale-invariant properties of $n-1$ dimensional sets across analysis, geometric measure theory, and PDEs. The present paper surveys…
Beyond the new results mentioned hereafter, this article aims at familiarizing researchers working in applied fields -- such as physics or economics -- with notions or formulas that they use daily without always identifying all their…
In this paper we study the following quantitative isoperimetric inequality in the plane: $\lambda_0^2(\Omega) \leq C \delta(\Omega)$ where $\delta$ is the isoperimetric deficit and $\lambda_0$ is the barycentric asymmetry. Our aim is to…
Let $G$ be a connected graph. The average distance of a vertex $v$ of $G$ is the arithmetic mean of the distances from $v$ to all other vertices of $G$. The proximity and remoteness of $G$ are defined as the minimum and maximum,…
The point-to-set principle of J. Lutz and N. Lutz (2018) has recently enabled the theory of computing to be used to answer open questions about fractal geometry in Euclidean spaces $\mathbb{R}^n$. These are classical questions, meaning that…