Related papers: Distance sets bounds for polyhedral norms via effe…
In this paper, we prove Erd\H{o}s distance conjecture in $\mathbb{R}^d$, namely, a set of $n$ points in $\mathbb{R}^2$ determines $\Omega(\frac{n}{\sqrt{\log n}})$ distances, and for $d\ge 3$, a set of $n$ points in $\mathbb{R}^d$…
In this paper, we study the metrical theory of the growth rate of digits in L\"{u}roth expansions. More precisely, for $ x\in \left( 0,1 \right] $, let $ \left[ d_1\left( x \right) ,d_2\left( x \right) ,\cdots \right] $ denote the…
We prove that if the Hausdorff dimension of $E \subset {\Bbb R}^d$, $d \ge 3$, is greater than $\min \left\{ \frac{dk+1}{k+1}, \frac{d+k}{2} \right\},$ then the ${k+1 \choose 2}$-dimensional Lebesgue measure of $T_k(E)$, the set of…
We study similarity classes of point configurations in $\R^d$. Given a finite collection of points, a well-known question is: How high does the Hausdorff dimension $\hd(E)$ of a compact set $E \subset {\Bbb R}^d$, $d \ge 2$, need to be to…
We prove a structure theorem for any $n$-rectifiable set $E\subset \mathbb{R}^{n+1}$, $n\ge 1$, satisfying a weak version of the lower ADR condition, and having locally finite $H^n$ ($n$-dimensional Hausdorff) measure. Namely, that…
This paper is devoted to dimensional reductions via the norm resolvent convergence. We derive explicit bounds on the resolvent difference as well as spectral asymptotics. The efficiency of our abstract tool is demonstrated by its…
Extending a result of Mashreghi and Ransford, we prove that every complex separable infinite dimensional Fr\'echet space with a continuous norm is isomorphic to a space continuously included in a space of holomorphic functions on the unit…
We provide quantitative estimates for the supremum of the Hausdorff dimension of sets in the real line which avoid $\varepsilon$-approximations of arithmetic progressions. Some of these estimates are in terms of Szemer\'{e}di bounds. In…
We present a (combinatorial) algorithm with running time close to $O(n^d)$ for computing the minimum directed $L_\infty$ Hausdorff distance between two sets of $n$ points under translations in any constant dimension $d$. This substantially…
Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…
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…
We determine the Hausdorff dimension for the range of a class of pure jump Markov processes in $\mathbb{R}^d$, which turns out to be random and depends on the trajectories of these processes. The key argument is carried out through the SDE…
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…
This work proposes an algorithm to bound the minimum distance between points on trajectories of a dynamical system and points on an unsafe set. Prior work on certifying safety of trajectories includes barrier and density methods, which do…
In this note we will describe a simple and practical approach to get rigorous bounds on the Hausdorff dimension of limits sets for some one dimensional Markov iterated function schemes. The general problem has attracted considerable…
A closed interval and circle are the only smooth Julia sets in polynomial dynamics. D. Ruelle proved that the Hausdorff dimension of unicritical Julia sets close to the circle depends analytically on the parameter. Near the tip of the…
In this paper we obtain the rates of convergence of the algorithms given in [13] and [14] for an automatic computation of the centered Hausdorff and packing measures of a totally disconnected self-similar set. We evaluate these rates…
We study the complexity of approximating complex zero sets of certain $n$-variate exponential sums. We show that the real part, $R$, of such a zero set can be approximated by the $(n-1)$-dimensional skeleton, $T$, of a polyhedral…
A set in d dimensional Euclidean space with d larger than 2 having Hausdorff dimension at least d/2 must have distance set with Hausdorff dimension strictly greater than 1/2.
We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…