arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.7229math.DS
收藏

具有正勒贝格测度的自相似集的编码集的基数和复杂度

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

Simon Baker

摘要:

设$λ_{1},\ldots,λ_{n}$为$(0,1)$中的实数,$p_{1},\ldots,p_{n}$为$\mathbb{R}^{d}$中的点。考虑集合的地图$f_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} $给出的$$f_{j}(x)=λ_{j} x +(1-λ_{j})p_{j}.$$这是一个众所周知的结果,存在一个唯一的紧集$Λ\subset \mathbb{R}^{d}$满足$Λ=\cup_{j=1}^{n} f_{j}(Λ).$每个$x\in Λ$至少有一个编码,即序列$(ε_{i})_{i=1}^{\infty}\in \{1,\ldots,n\}^{\mathbb{N}}$满足$\lim_{N\to\infty}f_{ε_{1}}\cdots f_{ε_{N}} (0)=x.$我们研究的大小和复杂性的一个通用$x\in Λ$时,$Λ$有积极的勒贝格测度的编码集。特别是,我们表明,在一定的自然条件下,几乎每一个$x\inΛ$有一个连续的编码。我们还表明,几乎每一个$x\inΛ$有一个通用的编码。我们的工作没有假设$Λ$中存在孔,并改善现有的结果时,它是假设$Λ$不含孔。

英文摘要:

Let $λ_{1},\ldots,λ_{n}$ be real numbers in $(0,1)$ and $p_{1},\ldots,p_{n}$ be points in $\mathbb{R}^{d}$. Consider the collection of maps $f_{j}:\mathbb{R}^{d}\to\mathbb{R}^{d} $ given by $$f_{j}(x)=λ_{j} x +(1-λ_{j})p_{j}.$$ It is a well known result that there exists a unique compact set $Λ\subset \mathbb{R}^{d}$ satisfying $Λ=\cup_{j=1}^{n} f_{j}(Λ).$ Each $x\in Λ$ has at least one coding, that is a sequence $(ε_{i})_{i=1}^{\infty}\in \{1,\ldots,n\}^{\mathbb{N}}$ that satisfies $\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\in Λ$ when $Λ$ has positive Lebesgue measure. In particular, we show that under certain natural conditions almost every $x\inΛ$ has a continuum of codings. We also show that almost every $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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑