On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne
On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne
复制标题
关于自相似集编码集的复杂性和Chambernowne构造的一种变体
DOI:
10.1016/j.aim.2019.106934
复制
发表时间:
2020
影响因子:
1.7
通讯作者:
Baker S
中科院分区:
文献类型:
--
作者:
Baker S
Abstract Let F={p 0,…, p n} be a collection of points in R d. The set F naturally gives rise to a family of iterated function systems consisting of contractions of the form S i (x)= λ x+(1− λ) p i, i= 0,…, n, where λ∈(0, 1) and x∈ R d. Given F and λ it is well known that there exists a unique non-empty compact set X satisfying X=∪ i= 0 n S i (X). For each x∈ X there exists a sequence (a j) j= 1∞∈{0,…, n} N satisfying x= lim j→∞(S a 1∘⋯∘ S a j)(0). We call such a sequence a coding of x. In this paper we prove that for any F and k∈ N, there exists δ k (F)> 0 such that if λ∈(1− δ k (F), 1), then every point in the interior of X has a coding which is k-simply normal. Similarly, we prove that there exists δ u n i (F)> 0 such that if λ∈(1− δ u n i (F), 1), then every point in the interior of X has a coding containing all finite words. For some specific choices of F we obtain lower bounds for δ k (F) and δ u n i (F). We also prove some weaker statements that hold in the more general setting when the similarities in our iterated function systems exhibit different rates of contraction. Our proofs rely on a variation of a well known construction of a normal number due to Champernowne, and an approach introduced by Erdős and Komornik.
登录
查看更多内容
DOI:
--
发表时间:
2013-07
期刊:
arXiv: Dynamical Systems
影响因子:
--
作者:
Tom Kempton
通讯作者:
Tom Kempton
DOI:
10.1007/bf02954628
发表时间:
2013
期刊:
The New York Journal of Mathematics
影响因子:
--
作者:
K. Dajani;Charlene Kalle
通讯作者:
Charlene Kalle
影响因子:
0.9
作者:
P. Erdös;V. Komornik
通讯作者:
P. Erdös;V. Komornik
影响因子:
1.7
作者:
D. Broomhead;J. Montaldi;N. Sidorov
通讯作者:
D. Broomhead;J. Montaldi;N. Sidorov
DOI:
10.2307/2532125
发表时间:
1990-03
期刊:
--
影响因子:
--
作者:
K. Falconer
通讯作者:
K. Falconer