English
Related papers

Related papers: A new perspective on the distance problem over pri…

200 papers

Let $\mathbb F_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb F_q$ with $q$ elements. For each non-zero $r$ in $\mathbb F_q$ and $E\subset \mathbb F_q^d$, we define $W(r)$ as the number of quadruples $(x,y,z,w)\in…

Number Theory · Mathematics 2023-09-06 Alex Iosevich , Doowon Koh , Firdavs Rakhmonov

Let $p_1,p_2,p_3$ be three non-collinear points in the plane, and let $P$ be a set of $n$ other points in the plane. We show that the number of distinct distances between $p_1,p_2,p_3$ and the points of $P$ is $\Omega(n^{6/11})$, improving…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Jozsef Solymosi

Given any two vertices u, v of a random geometric graph, denote by d_E(u,v) their Euclidean distance and by d_G(u,v) their graph distance. The problem of finding upper bounds on d_G(u,v) in terms of d_E(u,v) has received a lot of attention…

Discrete Mathematics · Computer Science 2014-04-21 Josep Díaz , Dieter Mitsche , Guillem Perarnau , Xavier Pérez-Giménez

We consider the distance function from an arbitrary point $p$ on a flat surface, and determine the set $F_{p}$ of all \emph{farthest points} (i.e., points at maximal distance) from $p$.

Metric Geometry · Mathematics 2018-09-19 Joël Rouyer , Costin Vîlcu

The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…

Computational Geometry · Computer Science 2021-08-18 Therese Biedl , Anna Lubiw , Anurag Murty Naredla , Peter Dominik Ralbovsky , Graeme Stroud

In this work, the relativistic phenomena of Lorentz-Fitzgerald contraction and time dilation are derived using a modified distance formula that is appropriate for discrete space. This new distance formula is different than the Pythagorean…

General Physics · Physics 2018-10-03 David Crouse , Joseph Skufca

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…

Classical Analysis and ODEs · Mathematics 2026-04-28 Bochen Liu

The unit Euclidean distance degree and the generic Euclidean distance degree are two well-studied invariants of projective varieties. These quantities measure the algebraic complexity of nearest-point problems on a variety, and in many…

Algebraic Geometry · Mathematics 2026-05-14 Laurenţiu G. Maxim , Jose Israel Rodriguez , Botong Wang

In this paper we study some generalized versions of a recent result due to Covert, Koh, and Pi (2015). More precisely, we prove that if a subset $\mathcal{E}$ in a regular variety satisfies $|\mathcal{E}|\gg…

Number Theory · Mathematics 2016-08-24 Pham Van Thang , Do Duy Hieu

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…

Combinatorics · Mathematics 2026-01-21 Benjamin Grayzel

\emph{A maximal distance minimizer} for a given compact set $M \subset \mathbb{R}^2$ and some given $r > 0$ is a set having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…

Metric Geometry · Mathematics 2021-06-03 D. D. Cherkashin , A. S. Gordeev , G. A. Strukov , Y. I. Teplitskaya

A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…

Combinatorics · Mathematics 2025-12-16 N. N. Avdeev , E. A. Lushina

Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shortest path distance along the network, known as the network…

Computational Geometry · Computer Science 2014-11-07 Prosenjit Bose , Kai Dannies , Jean-Lou De Carufel , Christoph Doell , Carsten Grimm , Anil Maheshwari , Stefan Schirra , Michiel Smid

We prove a series of results on the size of distance sets corresponding to sets in the Euclidean space. These distances are generated by bounded convex sets and the results depend explicitly on the geometry of these sets. We also use a…

Classical Analysis and ODEs · Mathematics 2007-05-23 A. Iosevich , I. Laba

The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…

Combinatorics · Mathematics 2008-09-09 Paz Carmi , Vida Dujmović , Pat Morin , David R. Wood

The constrained minimization (respectively maximization) of directed distances and of related generalized entropies is a fundamental task in information theory as well as in the adjacent fields of statistics, machine learning, artificial…

Information Theory · Computer Science 2024-10-28 Michel Broniatowski , Wolfgang Stummer

We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…

Differential Geometry · Mathematics 2024-08-15 Simon Mataigne , P. -A. Absil , Nina Miolane

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}$.…

Classical Analysis and ODEs · Mathematics 2018-01-19 Alex Iosevich , Bochen Liu

Within the framework of algebraic quantum field theory a general method is presented which allows one to compute and classify the short distance (scaling) limit of any algebra of local observables. The results can be used to determine the…

High Energy Physics - Theory · Physics 2007-05-23 Detlev Buchholz

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…

Classical Analysis and ODEs · Mathematics 2018-11-09 Pablo Shmerkin
‹ Prev 1 4 5 6 7 8 10 Next ›