Papers
Topics
Authors
Recent
Search
2000 character limit reached

Projections of planar sets in well-separated directions

Published 27 Apr 2015 in math.CA | (1504.07189v5)

Abstract: First, let KB(0,1)R<sup>2K \subset B(0,1) \subset \mathbb{R}<sup>{2} be a set with H<em><sup>1(K)</sup>1\mathcal{H}<em>{\infty}<sup>{1}(K)</sup> \sim 1, and write π</em>e(K)\pi</em>{e}(K) for the orthogonal projection of KK into the line spanned by eS<sup>1e \in S<sup>{1}. For $1/2 \leq s &lt; 1$, write Es:=e:N(πe(K),δ)δ<sup>s,</sup>E_{s} := {e : N(\pi_{e}(K),\delta) \leq \delta<sup>{-s}},</sup> where N(A,r)N(A,r) is the rr-covering number of the set AA. It is well-known -- and essentially due to R. Kaufman -- that N(Es,δ)δ<sup>sN(E_{s},\delta) \lessapprox \delta<sup>{-s}. Using the polynomial method, I prove that $$ N(E_{s},r) \lessapprox \min\left{\delta<sup>{-s}\left(\frac{\delta}{r}\right)<sup>{1/2},r<sup>{-1}\right},</sup></sup></sup> \quad \delta \leq r \leq 1.$$ I construct examples showing that the exponents in the bound are sharp for δrδ<sup>s\delta \leq r \leq \delta<sup>{s}. The second theorem concerns projections of $1$-Ahlfors-David regular sets. Let A1A \geq 1 and $1/2 \leq s &lt; 1$ be given. I prove that, for p=p(A,s)Np = p(A,s) \in \mathbb{N} large enough, the finite set of unit vectors $S_{p} := {e<sup>{2\pi</sup> i k/p} : 0 \leq k &lt; p}$ has the following property. If KB(0,1)K \subset B(0,1) is non-empty and $1$-Ahlfors-David regular with regularity constant at most AA, then 1peSpN(πe(K),δ)δ<sup>s\frac{1}{p} \sum_{e \in S_{p}} N(\pi_{e}(K),\delta) \geq \delta<sup>{-s} for all small enough $\delta &gt; 0$. In particular, dim<em>Bπ</em>e(K)s\overline{\dim}<em>{\text{B}} \pi</em>{e}(K) \geq s for some eSpe \in S_{p}.

Authors (1)
Citations (7)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.