English
Related papers

Related papers: Distinct Distances with $\ell_p$ Spaces

200 papers

We introduce an equivalence relation on the space $W^{1,1}(\Omega;{\mathbb S}^1)$ which classifies maps according to their "topological singularities". We establish sharp bounds for the distances (in the usual sense and in the Hausdorff…

Functional Analysis · Mathematics 2018-01-03 Haim Brezis , Petru Mironescu , Itai Shafrir

We study some discrete and continuous variants of the following problem of Erdos: given a finite subset P of R^2 or R^3, what is the maximum number of pairs (p_1,p_2) with p_1,p_2 in P and |p_1 -p_2 |=1?

Classical Analysis and ODEs · Mathematics 2012-10-01 Daniel Oberlin , Richard Oberlin

We study a family of variants of Erd\H os' unit distance problem, concerning distances and dot products between pairs of points chosen from a large finite point set. Specifically, given a large finite set of $n$ points $E$, we look for…

Combinatorics · Mathematics 2020-12-01 Slade Gunter , Eyvi Palsson , Ben Rhodes , Steven Senger

In this paper we study boundary value problems for higher order elliptic differential operators in divergence form. We establish well posedness for problems with boundary data in Besov spaces $\dot B^{p,p}_s$, $p\leq 1$, given well…

Analysis of PDEs · Mathematics 2017-08-18 Ariel Barton

We consider weighted $L^p$-Hardy inequalities involving the distance to the boundary of a domain in the $n$-dimensional Euclidean space with nonempty boundary. Using criticality theory, we give an alternative proof of the following result…

Analysis of PDEs · Mathematics 2021-01-21 Divya Goel , Yehuda Pinchover , Georgios Psaradakis

In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…

Computational Complexity · Computer Science 2022-08-16 D. M. Stull

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

We study the unit distance and distinct distances problems over the planar hypercomplex numbers: the dual numbers $\mathbb{D}$ and the double numbers $\mathbb{S}$. We show that the distinct distances problem in $\mathbb{S}^2$ behaves…

Combinatorics · Mathematics 2020-02-18 David FitzPatrick

This article focuses on Lp-estimates for the square root of elliptic systems of second order in divergence form on a bounded domain. We treat complex bounded measurable coefficients and allow for mixed Dirichlet/Neumann boundary conditions…

Classical Analysis and ODEs · Mathematics 2021-03-29 Moritz Egert

We study the problem of representing all distances between $n$ points in $\mathbb R^d$, with arbitrarily small distortion, using as few bits as possible. We give asymptotically tight bounds for this problem, for Euclidean metrics, for…

Computational Geometry · Computer Science 2021-10-08 Piotr Indyk , Tal Wagner

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

Combinatorics · Mathematics 2024-05-14 Eyvindur A. Palsson , Edward Yu

According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…

Discrete Mathematics · Computer Science 2014-07-10 Ronan Le Bras , Carla P. Gomes , Bart Selman

This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…

Information Theory · Computer Science 2016-11-17 Igal Sason

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $\Pi$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_{\Pi}[\textrm{for all }x, \ \|Ax\|_p \leq \|\Pi Ax\|_p \leq \kappa \|Ax\|_p] \geq 9/10,$$…

Data Structures and Algorithms · Computer Science 2018-04-10 Ruosong Wang , David P. Woodruff

We solve the Neumann problem in the half space $\mathbb{R}^{n+1}_+$, for higher order elliptic differential equations with variable self-adjoint $t$-independent coefficients, and with boundary data in $L^p$, where…

Analysis of PDEs · Mathematics 2020-02-11 Ariel Barton

We consider the following singularly perturbed elliptic problem \[ - {\varepsilon ^2}\Delta u + u = f(u){\text{ in }}\Omega ,{\text{ }}u > 0{\text{ in }}\Omega ,{\text{ }}u = 0{\text{ on }}\partial \Omega , \] where $\Omega$ is a domain in…

Analysis of PDEs · Mathematics 2022-07-12 Yi He , Juncheng Wei , Jianjun Zhang

Adapting a definition given by Bjerkevik and Lesnick for multiparameter persistence modules, we introduce an $\ell^p$-type extension of the interleaving distance on merge trees. We show that our distance is a metric, and that it…

Computational Geometry · Computer Science 2022-03-23 Robert Cardona , Justin Curry , Tung Lam , Michael Lesnick

In this paper, we study the Erd\H{o}s-Falconer distance problem in five dimensions for sets of Cartesian product structures. More precisely, we show that for $A\subset \mathbb{F}_p$ with $|A|\gg p^{\frac{13}{22}}$, then…

Combinatorics · Mathematics 2021-09-08 Francois Clement , Thang Pham

We derive distributional limits for empirical transport distances between probability measures supported on countable sets. Our approach is based on sensitivity analysis of optimal values of infinite dimensional mathematical programs and a…

Probability · Mathematics 2018-09-18 Carla Tameling , Max Sommerfeld , Axel Munk