Diophantine approximations on random fractals
Yiftach Dayan

TL;DR
This paper proves that certain random fractals in Euclidean space almost surely intersect all hyperplane absolute winning sets with full Hausdorff dimension, revealing deep connections between fractal geometry, Diophantine approximation, and probabilistic methods.
Contribution
It introduces a novel approach using Galton-Watson trees to analyze intersections of random fractals with Diophantine sets, extending results to a broad class of random fractals beyond traditional models.
Findings
Fractal percolation sets almost surely intersect every HAW set with full Hausdorff dimension.
Existence of hyperplane diffuse, Ahlfors-regular subsets within fractal percolation sets.
Method applicable to general random fractals generated by similarity IFS, not contained in a single hyperplane.
Abstract
We show that fractal percolation sets in almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if is a realization of a fractal percolation process, then almost surely (conditioned on ), for every countable collection of diffeomorphisms of , , where is the set of badly approximable vectors in . We show this by proving that almost surely contains hyperplane diffuse subsets which are Ahlfors-regular with dimensions arbitrarily close to . We achieve this by analyzing Galton-Watson trees and showing that they almost surely contain…
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 · Stochastic processes and statistical mechanics · Theoretical and Computational Physics
