On the cardinality and complexity of the set of codings for self-similar sets with positive Lebesgue measure

preprint2014arXivOpen access

Abstract

Let λ1,…,λnλ_{1},\ldots,λ_{n} be real numbers in (0,1)(0,1) and p1,…,pnp_{1},\ldots,p_{n} be points in Rd\mathbb{R}^{d}. Consider the collection of maps fj:Rd→Rdf_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} given by fj(x)=λjx+(1−λj)pj.f_{j}(x)=λ_{j} x +(1-λ_{j})p_{j}. It is a well known result that there exists a unique compact set Λ⊂RdΛ\subset \mathbb{R}^{d} satisfying Λ=∪j=1nfj(Λ).Λ=\cup_{j=1}^{n} f_{j}(Λ). Each x∈Λx\in Λ has at least one coding, that is a sequence (εi)i=1∞∈{1,…,n}N(ε_{i})_{i=1}^{\infty}\in \{1,\ldots,n\}^{\mathbb{N}} that satisfies lim⁡N→∞fε1⋯fεN(0)=x.\lim_{N\to\infty}f_{ε_{1}}\cdots f_{ε_{N}} (0)=x. We study the size and complexity of the set of codings of a generic x∈Λx\in Λ when ΛΛ has positive Lebesgue measure. In particular, we show that under certain natural conditions almost every x∈Λx\inΛ has a continuum of codings. We also show that almost every x∈Λx\inΛ has a universal coding. Our work makes no assumptions on the existence of holes in ΛΛ and improves upon existing results when it is assumed ΛΛ contains no holes.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.