Patterns in Random Fractals

Abstract

We characterize the existence of certain geometric configurations in the fractal percolation limit set A in terms of the almost sure dimension of A. Some examples of the configurations we study are: homothetic copies of finite sets, angles, distances, and volumes of simplices. In the spirit of relative Szemer\'edi theorems for random discrete sets, we also consider the corresponding problem for sets of positive -measure, where is the natural measure on A. In both cases we identify the dimension threshold for each class of configurations. These results are obtained by investigating the intersections of the products of m independent realizations of A with transversal planes and, more generally, algebraic varieties, and extend some well known features of independent percolation on trees to a setting with long-range dependencies.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…