相关论文: Distinct Distances with $\ell_p$ Spaces

A common way to discretize a probability measure is to use an empirical measure as a discrete approximation. But how far from being optimal is this approximation in the p-Wasserstein distance? In this paper, we study this question in two…

In 1995, D. Jerison and C. Kenig in \cite{JK-1995} considered the the inhomogeneous Dirichlet problem $\Delta u= f$ on $\Omega$, $u=0$ on $\partial\Omega$ in Lipschitz domains. One of their main results shows that the $W^{1,p}$ estimate…

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…

We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $\chi^2$-distance. The results are based on proper non-uniform estimates for…

We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…

We consider a one-dimensional stochastic differential equations (SDE) with irregular coefficients. The purpose of this paper is to estimate the $L^p(\Omega)$-difference of SDEs using the norm of the difference of coefficients, where the…

We provide sharp lower and upper bounds for the Gelfand widths of $\ell_p$-balls in the $N$-dimensional $\ell_q^N$-space for $0<p\leq 1$ and $p<q \leq 2$. Such estimates are highly relevant to the novel theory of compressive sensing, and…

In general, it is difficult to measure distances in the Weil-Petersson metric on Teichm\"uller space. Here we consider the distance between strata in the Weil-Petersson completion of Teichm\"uller space of a surface of finite type. Wolpert…

The following generalisation of the Erd\H{o}s unit distance problem was recently suggested by Palsson, Senger and Sheffer. Given $k$ positive real numbers $\delta_1,\dots,\delta_k$, a $(k+1)$-tuple $(p_1,\dots,p_{k+1})$ in $\mathbb{R}^d$ is…

We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…

We study the extreme and the periodic $L_p$ discrepancy of point sets in the $d$-dimensional unit cube. The extreme discrepancy uses arbitrary sub-intervals of the unit cube as test sets, whereas the periodic discrepancy is based on…

We study the double obstacle problem for p-harmonic functions on arbitrary bounded nonopen sets E in quite general metric spaces. The Dirichlet and single obstacle problems are included as special cases. We obtain Adams' criterion for the…

Let $\mathcal{O}_K$ be the ring of integers of an algebraic number field $K$ embedded into $\mathbb{C}$. Let $X$ be a subset of the Euclidean space $\mathbb{R}^d$, and $D(X)$ be the set of the squared distances of two distinct points in…

This paper presents an extension of the Elias bound on the minimum distance of codes for discrete alphabets with general, possibly infinite-valued, distances. The bound is obtained by combining a previous extension of the Elias bound,…

Let $X$ be a metric space equipped with a doubling measure. We consider weights $w(x)=\operatorname{dist}(x,E)^{-\alpha}$, where $E$ is a closed set in $X$ and $\alpha\in\mathbb R$. We establish sharp conditions, based on the Assouad…

The search-type problem of evacuating 2 robots in the wireless model from the (Euclidean) unit disk was first introduced and studied by Czyzowicz et al. [DISC'2014]. Since then, the problem has seen a long list of follow-up results…

Let $S$ be a set of points in $\mathbb{R}^2$ contained in a circle and $P$ an unrestricted point set in $\mathbb{R}^2$. We prove the number of distinct distances between points in $S$ and points in $P$ is at least…

Given a set $X\subseteq\mathbb{R}^2$ of $n$ points and a distance $d>0$, the multiplicity of $d$ is the number of times the distance $d$ appears between points in $X$. Let $a_1(X) \geq a_2(X) \geq \cdots \geq a_m(X)$ denote the…