Related papers: Distinct Distances with $\ell_p$ Spaces

Many data analysis problems can be cast as distance geometry problems in \emph{space forms} -- Euclidean, spherical, or hyperbolic spaces. Often, absolute distance measurements are often unreliable or simply unavailable and only proxies to…

Given a locally compact, complete metric space $({\rm X},{\sf D})$ and an open set $\Omega\subseteq{\rm X}$, we study the class of length distances $\sf d$ on $\Omega$ that are bounded from above and below by fixed multiples of the ambient…

We investigate error bounds for numerical solutions of divergence structure linear elliptic PDEs on compact manifolds without boundary. Our focus is on a class of monotone finite difference approximations, which provide a strong form of…

Let $\Omega$ be a bounded domain in $\mathbb{R}^2$ with smooth boundary, we study the following elliptic Dirichlet problem $$ \begin{cases} -\Delta\upsilon= e^{\upsilon}-s\phi_1-4\pi\alpha\delta_p-h(x)\,\,\,\,…

We study the structure of planar point sets that determine a small number of distinct distances. Specifically, we show that if a set P of n points determines o(n) distinct distances, then no line contains \Omega(n^{7/8}) points of P and no…

We establish the first pointwise ergodic theorems along thin sets of prime numbers; a set with zero density with respect to the primes. For instance we will be able to achieve this with the Piatetski-Shapiro primes. Our methods will be…

Let $\ell$ and $p \geq 3$ be distinct prime numbers. Let $E/\mathbb{Q}_{\ell}$ be an elliptic curve with $p$-torsion module $E_p$. Let $\mathbb{Q}_{\ell}(E_p)$ be the $p$-torsion field of $E$. We provide a complete description of the degree…

In this paper, we introduce the $\ell_p^p$-error metric (for $p \geq 2$) when answering linear queries under the constraint of differential privacy. We characterize such an error under $(\epsilon,\delta)$-differential privacy. Before this…

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…

We study the asymptotic behaviour of the maximum interpoint distance of random points in a planar bounded set with an unique major axis and a boundary behaving like an ellipse at the endpoints. Our main result covers the case of uniformly…

We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…

The Erd\H os-Falconer distance problem in $\mathbb{Z}_q^d$ asks one to show that if $E \subset \mathbb{Z}_q^d$ is of sufficiently large cardinality, then $\Delta(E) := \{(x_1 - y_1)^2 + \dots + (x_d - y_d)^2 : x, y \in E\}$ satisfies…

We consider second-order elliptic equations in a half space with leading coefficients measurable in a tangential direction. We prove the $W^2_p$-estimate and solvability for the Dirichlet problem when $p\in (1,2]$, and for the Neumann…

In the work by M. C. Lee, A. Naber, and R. Neumayer a beautiful $\varepsilon$-regularity theorem is proved under small negative scalar curvature and entropy bounds. In that paper, the $d_p$ distance for Riemannian manifolds is introduced…

The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…

We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…

In this paper we study the Dirichlet problem for real-valued second order divergence form elliptic operators with boundary data in H\"{o}lder spaces. Our context is that of open sets $\Omega \subset \mathbb{R}^{n+1}$, $n \ge 2$, satisfying…

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 address an analog of a problem introduced by Erd\H{o}s and Fishburn, itself an inverse formulation of the famous Erd\H{o}s distance problem, in which the usual Euclidean distance is replaced with the metric induced by the $\ell^1$-norm,…

In this note we consider distinct distances determined by points in an integer lattice. We first consider Erdos's lower bound for the square lattice, recast in the setup of the so-called Elekes-Sharir framework \cite{ES11,GK11}, and show…