English
Related papers

Related papers: A Reduction for the Distinct Distances Problem in …

200 papers

Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…

Machine Learning · Statistics 2014-09-18 Luwan Zhang , Grace Wahba , Ming Yuan

This paper considers an extremal version of the Erd\H{o}s distinct distances problem. For a point set $P \subset \mathbb R^d$, let $\Delta(P)$ denote the set of all Euclidean distances determined by $P$. Our main result is the following: if…

Metric Geometry · Mathematics 2023-11-28 Oliver Roche-Newton , Dmitrii Zhelezov

The present paper discusses the problem of least-squares over the real symplectic group of matrices Sp(2n,R)$. The least-squares problem may be extended from flat spaces to curved spaces by the notion of geodesic distance. The resulting…

Numerical Analysis · Computer Science 2013-03-08 Simone Fiori

This paper develops a construction of families of $ U(1)^{n-2} $-invariant special Lagrangian $ n $-folds in $ \mathbb{C}^{n} $, extending the analytic framework introduced by Joyce ($ n = 3 $) to arbitrary dimension. By reducing the…

Differential Geometry · Mathematics 2026-02-24 Mia S. L. Beard

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

Optimization and Control · Mathematics 2021-10-25 Paolo Albano , Vincenzo Basco , Piermarco Cannarsa

In this paper, we prove the first incidence bound for points and conics over prime fields. As applications, we prove new results on expansion of bivariate polynomial images and on certain variations of distinct distances problems. These…

Combinatorics · Mathematics 2023-01-13 Ali Mohammadi , Thang Pham , Audie Warren

Various real-world problems consist of partitioning a set of locations into disjoint subsets, each subset spread in a way that it covers the whole set with a certain radius. Given a finite set S, a metric d, and a radius r, define a subset…

Data Structures and Algorithms · Computer Science 2023-02-08 Eran Rosenbluth

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

Classical Analysis and ODEs · Mathematics 2007-05-23 Alex Iosevich , Misha Rudnev

In this work, the relativistic phenomena of Lorentz contraction and time dilation are derived using a modified distance formula appropriate for discrete space. This new distance formula is different than Pythagoras's theorem but converges…

General Relativity and Quantum Cosmology · Physics 2018-10-10 David Crouse , Joseph Skufca

We present a polynomial partitioning theorem for finite sets of points in the real locus of an irreducible complex algebraic variety of codimension at most two. This result generalizes the polynomial partitioning theorem on the Euclidean…

Algebraic Geometry · Mathematics 2015-09-22 Saugata Basu , Martin Sombra

We discuss a unified approach to a class of geometric combinatorics incidence problems in $2D$, of the Erd\"os distance type. The goal is obtaining the second moment estimate, that is given a finite point set $S$ and a function $f$ on…

Metric Geometry · Mathematics 2016-09-06 Misha Rudnev , J. M. Selig

This paper is devoted to the study of geodesic distances defined on a subdomain of a given Carnot group, which are bounded both from above and from below by fixed multiples of the Carnot-Carath\'{e}odory distance. We show that the uniform…

Analysis of PDEs · Mathematics 2022-02-18 Fares Essebei , Enrico Pasqualetto

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose

We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the…

Optimization and Control · Mathematics 2017-10-10 Jasmijn A. Baaijens , Jan Draisma

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

We present a geometric framework for discrete classical field theories, where fields are modeled as "morphisms" defined on a discrete grid in the base space, and take values in a Lie groupoid. We describe the basic geometric setup and…

Mathematical Physics · Physics 2008-11-26 Joris Vankerschaver , Frans Cantrijn

In this paper, using the compression method, we recover the lower bound for the Erd\H{o}s unit distance problem and provide an alternative proof to the distinct distance conjecture. In particular, in $\mathbb{R}^k$ for all $k\geq 2$, we…

Metric Geometry · Mathematics 2026-05-07 Theophilus Agama

We improve the theorem of Beck giving a lower bound on the number of $k$-flats spanned by a set of points in real space, and improve the bound of Elekes and T\'oth on the number of incidences between points and $k$-flats in real space.

Combinatorics · Mathematics 2020-06-29 Ben Lund

Let $\mathrm{R}$ be a real closed field. We prove that for any fixed $d$, the equivariant rational cohomology groups of closed symmetric semi-algebraic subsets of $\mathrm{R}^k$ defined by polynomials of degrees bounded by $d$ vanishes in…

Algebraic Topology · Mathematics 2018-02-15 Saugata Basu , Cordian Riener

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo