The connectedness of Sierpi\'nski sponges with rotational and reflectional components and associated graph-directed systems

Abstract

We provide two methods to characterize the connectedness of all d-dimensional generalized Sierpi\'nski sponges whose corresponding IFSs are allowed to have rotational and reflectional components. Our approach is to reduce it to an intersection problem between the coordinates of graph-directed attractors. More precisely, let (K1,…,Kn) be a Cantor-type graph-directed attractor in Rd. By creating an auxiliary graph, we provide an effective criterion for whether Ki Kj is empty for every pair of 1≤ i,j≤ n. Moreover, the emptiness can be checked by examining only a finite number of geometric approximations of the attractor. The approach is also applicable to more general graph-directed systems.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…