Related papers: Distance bounds for high dimensional consistent di…

Erd\H{o}s asked whether every $n$-point set in Euclidean space whose $\binom{n}{2}$ pairwise distances are mutually at least $1$ apart must have diameter at least $(1+o(1))n^2$. We disprove this statement by constructing for every prime…

We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…

In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…

In $\mathbb{Z}^d$ with $d\ge 5$, we consider the time constant $\rho_u$ associated to the chemical distance in random interlacements at low intensity $u \ll 1$. We prove an upper bound of order $u^{-1/2}$ and a lower bound of order…

$\newcommand{\Re}{\mathbb{R}}$We study the minWSPD problem of computing the minimum-size well-separated pairs decomposition of a set of points, and show constant approximation algorithms in low-dimensional Euclidean space and doubling…

We prove that if the Hausdorff dimension of a compact subset of ${\mathbb R}^d$ is greater than $\frac{d+1}{2}$, then the set of angles determined by triples of points from this set has positive Lebesgue measure. Sobolev bounds for…

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

The Falconer distinct distance problem asks for a compact set $E\subset\mathbb{R}^d$ how large its Hausdorff dimension needs to be to ensure that the Lebesgue measure of its distance set is positive. In this paper we consider the analogous…

This paper concerns the asymptotic expansion of the solution of the Dirichlet-Laplace problem in a domain with small inclusions. This problem is well understood for the Neumann condition in dimension greater than two or Dirichlet condition…

We prove an estimate on the Hausdorff-dimension of the set of two-sided boundary points of general Sobolev-extension domains on Euclidean spaces. We also present examples showing lower bounds on possible dimension estimates of this type.

For $d\ge 3$ we first show that the Hausdorff dimension of the set of $A$-divergent on average points in the $(d-1)$-dimensional closed horosphere in the space of $d$-dimensional Euclidean lattices, where $A$ is the group of positive…

Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…

This paper develops a new technique for proving amortized, randomized cell-probe lower bounds on dynamic data structure problems. We introduce a new randomized nondeterministic four-party communication model that enables "accelerated",…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…

Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…

We consider weighted Hardy inequalities involving the distance function to the boundary of a domain in the $N$-dimensional Euclidean space with nonempty boundary. We give a lower bound for the corresponding best Hardy constant for a domain…

This paper significantly strengthens directed low-diameter decompositions in several ways. We define and give the first results for separated low-diameter decompositions in directed graphs, tighten and generalize probabilistic guarantees,…

We prove that if the Hausdorff dimension of $E\subset\mathbb{R}^d$, $d\geq 2$ is greater than $\frac{d}{2}+\frac{1}{3}$, the set of gaps of $2$-chains inside $E$, $$\Delta_2(E)=\{(|x-y|, |y-z|): x, y, z\in E \}\subset\mathbb{R}^2$$ has…

Digital Kronecker-sequences are a non-archimedean analog of classical Kronecker-sequences whose construction is based on Laurent series over a finite field. In this paper it is shown that for almost all digital Kronecker-sequences the star…

We improve by an exponential factor the best known asymptotic upper bound for the density of sets avoiding 1 in Euclidean space. This result is obtained by a combination of an analytic bound that is an analogue of Lovasz theta number and of…