English
Related papers

Related papers: A light metric spanner

200 papers

In this short note, we study the distribution of spreads in a point set $\mathcal{P} \subseteq \mathbb{F}_q^d$, which are analogous to angles in Euclidean space. More precisely, we prove that, for any $\varepsilon > 0$, if $|\mathcal{P}|…

Combinatorics · Mathematics 2018-01-03 Ben Lund , Thang Pham , Le Anh Vinh

Weak gravitational lensing due to the inhomogeneous matter distribution in the universe is an important systematic uncertainty in the use of standard candles in cosmology. There are two different descriptions of weak lensing amplification,…

Astrophysics · Physics 2009-11-10 Yun Wang , Jason Tenbarge , Bobby Fleshman

This work discusses self-improving properties of the Muckenhoupt condition and weighted norm inequalities for the Hardy-Littlewood maximal function on metric measure spaces with a doubling measure. Our main result provides direct proofs of…

Classical Analysis and ODEs · Mathematics 2025-01-30 Juha Kinnunen , Juha Lehrbäck , Antti V. Vähäkangas , Dachun Yang

We prove that for all integers $2\leq m\leq d-1$, there exists doubling measures on $\mathbb{R}^d$ with full support that are $m$-rectifiable and purely $(m-1)$-unrectifiable in the sense of Federer (i.e. without assuming…

Metric Geometry · Mathematics 2025-05-09 Matthew Badger , Raanan Schul

We show how to construct $(1+\varepsilon)$-spanner over a set $P$ of $n$ points in $\mathbb{R}^d$ that is resilient to a catastrophic failure of nodes. Specifically, for prescribed parameters $\vartheta,\varepsilon \in (0,1)$, the computed…

Computational Geometry · Computer Science 2020-05-27 Kevin Buchin , Sariel Har-Peled , Daniel Olah

We study the structure of the support of a doubling measure by analyzing its self-similarity properties, which we estimate using a variant of the $L^1$ Wasserstein distance. We show that measure satisfying certain self-similarity conditions…

Metric Geometry · Mathematics 2014-11-11 Jonas Azzam , Guy David , Tatiana Toro

All possible variants of symmetric embedding of the metric of the spatially flat Friedman model into a ten-dimensional ambient space are analyzed. It is shown that only two such embeddings exist: the five-dimensional embedding found by…

General Relativity and Quantum Cosmology · Physics 2025-03-04 M. S. Sushkov , S. A. Paston

We prove some weighted refined decoupling estimates. As an application, we give an alternative proof of the following result on Falconer's distance set problem by the authors in a companion work: if a compact set $E\subset \mathbb{R}^d$ has…

Classical Analysis and ODEs · Mathematics 2023-09-12 Xiumin Du , Yumeng Ou , Kevin Ren , Ruixiang Zhang

Given a point set $P$ in the Euclidean plane and a parameter $t$, we define an \emph{oriented $t$-spanner} $G$ as an oriented subgraph of the complete bi-directed graph such that for every pair of points, the shortest closed walk in $G$…

Computational Geometry · Computer Science 2025-11-13 Kevin Buchin , Joachim Gudmundsson , Antonia Kalb , Aleksandr Popov , Carolin Rehs , André van Renssen , Sampson Wong

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

Algebraic Topology · Mathematics 2010-11-23 Djordje Baralic , Branislav Prvulovic , Gordana Stojanovic , Sinisa Vrecica , Rade Zivaljevic

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

Data Structures and Algorithms · Computer Science 2007-05-23 Yair Bartal , Manor Mendel

In the Geometric Median problem with outliers, we are given a finite set of points in d-dimensional real space and an integer m, the goal is to locate a new point in space (center) and choose m of the input points to minimize the sum of the…

Computational Geometry · Computer Science 2021-12-02 Vladimir Shenmaier

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin

We study those measures whose doubling constant is the least possible among doubling measures on a given metric space. It is shown that such measures exist on every metric space supporting at least one doubling measure. In addition, a…

Classical Analysis and ODEs · Mathematics 2025-09-16 Fernando Benito F. de la Cigoña , José M. Conde Alonso , Pedro Tradacete

Given a compact pseudo-metric space, we associate to it upper and lower dimensions, depending only on the metric. Then we construct a doubling metric for which the measure of a dillated ball is closely related to these dimensions.

Classical Analysis and ODEs · Mathematics 2007-05-23 Per Bylund , Jaume Gudayol

In geometric measure theory, there is interest in studying the interaction of measures with rectifiable sets. Here, we extend a theorem of Badger and Schul in Euclidean space to characterize rectifiable pointwise doubling measures in…

Classical Analysis and ODEs · Mathematics 2020-02-19 Lisa Naples

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…

Classical Analysis and ODEs · Mathematics 2007-11-30 Derrick Hart , Alex Iosevich

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

Computational Geometry · Computer Science 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

Given points in Euclidean space of arbitrary dimension, we prove that there exists a spanning tree having no vertices of degree greater than 3 with weight at most 1.559 times the weight of the minimum spanning tree. We also prove that there…

Computational Geometry · Computer Science 2014-07-18 Samuel Zbarsky