Combinatorics of linear iterated function systems with overlaps

DOI10.1088/0951-7715/20/5/013MaRDI QIDQ5297509zbMATH OpenOpenAlexFDO

Authors Nikita Sidorov

Publication date 11 July 2007

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0703607, https://www.research.manchester.ac.uk/portal/en/publications/combinatorics-of-linear-iterated-function-systems-with-overlaps(882022c2-d4e8-494c-bcd6-3e6e563899c0).html

zbMATH Keywords

attractorexpansion with deleted digitsiterated functions systemopen set condition

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Metric theory of other algorithms and expansions; measure and Hausdorff dimension (11K55) Fractals (28A80) Discrete-time Markov processes on general state spaces (60J05)

Abstract: Let $$ be points in ${mathbbR}^d$, and let ${f_j}_{j=0}^{m-1}$ be a one-parameter family of similitudes of ${mathbbR}^d$: ${\displaystyle }$ f_j(�m x) = lambda�m x + (1-lambda)�m p_j, j=0,...,m-1, ${\displaystyle }$ where $lambdain(0,1)$ is our parameter. Then, as is well known, there exists a unique self-similar attractor $S_{l}ambda$ satisfying $$. Each $$ has at least one address $(i_1,i_2,\mathrm{...})inpro{d}_1^{i}nfty0,1,\mathrm{...},m-1$, i.e., $$. We show that for $lambda$ sufficiently close to 1, each $$ has $2^{alep{h}_0}$ different addresses. If $lambda$ is not too close to 1, then we can still have an overlap, but there exist $$'s which have a unique address. However, we prove that almost every $$ has $2^{alep{h}_0}$ addresses, provided $S_{l}ambda$ contains no holes and at least one proper overlap. We apply these results to the case of expansions with deleted digits. Furthermore, we give sharp sufficient conditions for the Open Set Condition to fail and for the attractor to have no holes. These results are generalisations of the corresponding one-dimensional results, however most proofs are different.

Recommendations

• Multiple representations of real numbers on self-similar sets with overlaps
• On the cardinality and complexity of the set of codings for self-similar sets with positive Lebesgue measure
• A family of self-similar sets with overlaps
• Multiple codings of self-similar sets with overlaps
• The Hausdorff dimension of the region of multiplicity one of overlapping iterated function systems on the interval

Cited in

(25)

• Global fractal transformations and global addressing
• Overlapping iterated function systems on a segment
• The Hausdorff dimension of the region of multiplicity one of overlapping iterated function systems on the interval
• Autonomous choices among deterministic evolution-laws as source of uncertainty
• Intersection of Sierpinski gasket with its translation
• Exceptional digit frequencies and expansions in non-integer bases
• On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne
• On universal and periodic \(\beta\)-expansions, and the Hausdorff dimension of the set of all expansions
• Univoque sets for real numbers
• On a family of self-affine sets: topology, uniqueness, simultaneous expansions
• Critical base for the unique codings of fat Sierpinski gasket
• Periodic unique beta-expansions: the Sharkovskiĭ ordering
• Self-similar sets with an open set condition and great variety of overlaps
• Entropy, topological transitivity, and dimensional properties of unique \(q\)-expansions
• Multiple representations of real numbers on self-similar sets with overlaps
• Relative bifurcation sets and the local dimension of univoque bases
• On intrinsic and extrinsic rational approximation to Cantor sets
• Unique expansions and intersections of Cantor sets
• Overlapping Iterated Function Systems from the Perspective of Metric Number Theory
• Growth rate for beta-expansions
• Open dynamical systems with a moving hole
• Fractal dimensions for iterated graph systems
• Periodic unique codings of fat Sierpinski gasket
• Hausdorff dimension of double-base expansions and binary shifts with a hole
• On the cardinality and complexity of the set of codings for self-similar sets with positive Lebesgue measure

This page was built for publication: Combinatorics of linear iterated function systems with overlaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5297509)