Multiple codings for self-similar sets with overlaps
Abstract
In this paper we consider a general class E of self-similar sets with complete overlaps. Given a self-similar iterated function system =(E, \fi\i=1m)∈ E on the real line, for each point x∈ E we can find a sequence (ik)=i1i2…∈\1,…,m\ N, called a coding of x, such that x=n∞fi1 fi2·s fin(0). For k=1,2,…, 0 or 20 we investigate the subset Uk() which consists of all x∈ E having precisely k different codings. Among several equivalent characterizations we show that U1() is closed if and only if U_0() is an empty set. Furthermore, we give explicit formulae for the Hausdorff dimension of Uk(), and show that the corresponding Hausdorff measure of Uk() is always infinite for any k 2. Finally, we explicitly calculate the local dimension of the self-similar measure at each point in Uk() and U_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.