Papers
Topics
Authors
Recent
Search
2000 character limit reached

An improved bound on the packing dimension of Furstenberg sets in the plane

Published 29 Nov 2016 in math.CA | (1611.09762v2)

Abstract: Let 0≤s≤10 \leq s \leq 1. A set K⊂R2K \subset \mathbb{R}^{2} is a Furstenberg ss-set, if for every unit vector e∈S1e \in S^{1}, some line LeL_{e} parallel to ee satisfies dim⁡H[K∩Le]≥s.\dim_{\mathrm{H}} [K \cap L_{e}] \geq s. The Furstenberg set problem, introduced by T. Wolff in 1999, asks for the best lower bound for the dimension of Furstenberg ss-sets. Wolff proved that dim⁡HK≥max⁡{s+1/2,2s}\dim_{\mathrm{H}} K \geq \max\{s + 1/2,2s\} and conjectured that dim⁡HK≥(1+3s)/2\dim_{\mathrm{H}} K \geq (1 + 3s)/2. The only known improvement to Wolff's bound is due to Bourgain, who proved in 2003 that dim⁡HK≥1+ϵ\dim_{\mathrm{H}} K \geq 1 + \epsilon for Furstenberg $1/2$-sets KK, where ϵ>0\epsilon > 0 is an absolute constant. In the present paper, I prove a similar ϵ\epsilon-improvement for all $1/2 < s < 1$, but only for packing dimension: dim⁡pK≥2s+ϵ\dim_{\mathrm{p}} K \geq 2s + \epsilon for all Furstenberg ss-sets K⊂R2K \subset \mathbb{R}^{2}, where ϵ>0\epsilon > 0 only depends on ss. The proof rests on a new incidence theorem for finite collections of planar points and tubes of width δ>0\delta > 0. As another corollary of this theorem, I obtain a small improvement for Kaufman's estimate from 1968 on the dimension of exceptional sets of orthogonal projections. Namely, I prove that if K⊂R2K \subset \mathbb{R}^{2} is a linearly measurable set with positive length, and $1/2 < s < 1$, then dim⁡H{e∈S1:dim⁡pπe(K)≤s}≤s−ϵ\dim_{\mathrm{H}} \{e \in S^{1} : \dim_{\mathrm{p}} \pi_{e}(K) \leq s\} \leq s - \epsilon for some ϵ>0\epsilon > 0 depending only on ss. Here πe\pi_{e} is the orthogonal projection onto the line spanned by ee.

Authors (1)
Citations (15)

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.