On the packing dimension of Furstenberg sets
Pablo Shmerkin

TL;DR
This paper establishes a new lower bound for the packing dimension of Furstenberg sets, showing they are at least 1/2 plus alpha plus a positive correction, improving previous estimates.
Contribution
It provides an improved lower bound for the packing dimension of alpha-Furstenberg sets, extending results to more general line families and analyzing the sparsity of scales where sets resemble higher-dimensional sets.
Findings
Lower bound for packing dimension: 1/2 + alpha + c(alpha)
Extension to more general line families
Sparsity of scales where sets resemble higher-dimensional sets
Abstract
We prove that if , then the packing dimension of a set for which there exists a set of lines of dimension intersecting in dimension is at least for some . In particular, this holds for -Furstenberg sets, that is, sets having intersection of Hausdorff dimension with at least one line in every direction. Together with an earlier result of T. Orponen, this provides an improvement for the packing dimension of -Furstenberg sets over the "trivial" estimate for all values of . The proof extends to more general families of lines, and shows that the scales at which an -Furstenberg set resembles a set of dimension close to , if they exist, are rather sparse.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Computational Geometry and Mesh Generation · Mathematical Approximation and Integration
