2020
DOI: 10.48550/arxiv.2008.10555
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Fractal geometry of Bedford-McMullen carpets

Abstract: In 1984 Bedford and McMullen independently introduced a family of self-affine sets now known as Bedford-McMullen carpets. Their work stimulated a lot of research in the areas of fractal geometry and non-conformal dynamics. In this survey article we discuss some aspects of Bedford-McMullen carpets, focusing mostly on dimension theory.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 24 publications
0
6
0
Order By: Relevance
“…where O (i,j) is an element of the collection of rotations of 0 • , 180 • around the point (1/2, 1/2) and flips along the lines x = 1/2 or y = 1/2. When O (i,j) = id for all (i, j) ∈ D, the attractor associated with the IFS {ψ (i,j) : (i, j) ∈ D} is called a Barański carpet (please see [1]); if we further have a p ≡ n −1 and b q ≡ m −1 then the attractor is called a Bedford-McMullen carpet (please see [13]). In this case, it is easy to see that the intersection of every pair of level-k rectangles is their largest common face and our arguments work in this setting.…”
Section: Further Remarksmentioning
confidence: 99%
“…where O (i,j) is an element of the collection of rotations of 0 • , 180 • around the point (1/2, 1/2) and flips along the lines x = 1/2 or y = 1/2. When O (i,j) = id for all (i, j) ∈ D, the attractor associated with the IFS {ψ (i,j) : (i, j) ∈ D} is called a Barański carpet (please see [1]); if we further have a p ≡ n −1 and b q ≡ m −1 then the attractor is called a Bedford-McMullen carpet (please see [13]). In this case, it is easy to see that the intersection of every pair of level-k rectangles is their largest common face and our arguments work in this setting.…”
Section: Further Remarksmentioning
confidence: 99%
“…There are explicit formulas for the box, packing, Hausdorff, Assouad and lower dimensions of Bedford-McMullen sets, while the box dimension and the packing dimension always coincide. For example, see theorem 2.1 in [11] for these formulas. However, in general, it is not easy to obtain the intermediate dimension of Bedford-McMullen sets (see [1]).…”
Section: Application To Lipschitz Equivalencementioning
confidence: 99%
“…Given a Bedford-McMullen set E, we say E has uniform fibres if all non-empty rows contain the same number of rectangles. Notice that there is a dichotomy (see [11]), in the uniform fibres case,…”
Section: Application To Lipschitz Equivalencementioning
confidence: 99%
“…• A well-studied class of fractals are the self-affine carpets of Bedford and McMullen; for the definition and a survey of the dimension theory of such carpets, see [8]. If F is any Bedford-McMullen carpet with non-uniform fibres then 0 Section 4] and [19], but a precise formula remains elusive.…”
Section: The Intermediate Dimensionsmentioning
confidence: 99%
“…For some (but not all) Bedford-McMullen carpets, Proposition 3.10 gives the best lower bound for the intermediate dimensions for θ close to 1 that is known at the time of writing. Indeed, using the notation in [8,19] We have already seen that for sets such as F with 0 < dim B F < dim A F , Proposition 3.10 improves both general lower bounds [6, Proposition 2.4] and [5, (2.6)], and indeed in this case the gradient at θ = 1 of the former is dim A F − dim B F ≈ 0.148, and the gradient of the latter is dim B F ≈ 1.852. This example suggests that, at least for some carpets such as this one, Kolossváry's upper bound [19,Theorem 1.2] is closer to capturing the true behaviour of the intermediate dimensions than his lower bound.…”
Section: The Intermediate Dimensionsmentioning
confidence: 99%