2021
DOI: 10.1017/etds.2021.92
|View full text |Cite
|
Sign up to set email alerts
|

Dimension estimates for iterated function systems and repellers. Part II

Abstract: This is the second part of our study on the dimension theory of $C^1$ iterated function systems (IFSs) and repellers on $\mathbb {R}^d$ . In the first part [D.-J. Feng and K. Simon. Dimension estimates for $C^1$ iterated function systems and repellers. Part I. Preprint, 2020, arXiv:2007.15320], we proved that the upper box-counting dimension of the attractor of every $C^1$ IFS on ${\Bbb … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 49 publications
1
4
0
Order By: Relevance
“…In the continuation of this paper [22] we verify that upper bound estimates of the dimensions of the attractors and ergodic measures in the previous paragraph give the exact values of the dimensions for some families of C 1 non-conformal IFSs in R d at least typically. 'Typically' means that the assertions hold for almost all translations of the system.…”
Section: Introductionsupporting
confidence: 64%
“…In the continuation of this paper [22] we verify that upper bound estimates of the dimensions of the attractors and ergodic measures in the previous paragraph give the exact values of the dimensions for some families of C 1 non-conformal IFSs in R d at least typically. 'Typically' means that the assertions hold for almost all translations of the system.…”
Section: Introductionsupporting
confidence: 64%
“…An open problem is to find conditions under which we have equality in (1.5). This is true when d = 2 and in some examples in higher dimensions, see [FS22] for the latest results and a history of similar problems, in particular for IFS. Define the function D µ by replacing κ(µ, ν) by the random walk entropy h RW (µ) := inf n 1 n H(µ * n ).…”
mentioning
confidence: 74%
“…Much later, this was sharpened and extended to a more general class of self-affine systems by T. Jordan, M. Pollicott, and K. Simon [22] in the framework of "self-affine transversality". Very recently, self-affine transversality was further extended to non-linear non-conformal systems by De-Jun Feng and Károly Simon [23].…”
Section: On Self-affine Ifssmentioning
confidence: 99%
“…(33)Denotec 1 = (2C 1 ) −β/α . Then {(ω,τ): ρ(ω,τ)≥(|y−z|/2C 1 ) 1/α } ρ(ω, τ) −β dµ(ω) dµ(τ) = c 1 |y−z| −β/α µ × µ) (ω, τ) : ρ(ω, τ) ≤ t −1/β dt ≤ c 1 |y−z| −β/α −γ µ /β dt |y − z| − β−γµ α (recall that γ µ < β),where we used(23). Finally,R 2d |y − z| − β−γµ α dη(y) dη(z) < ∞,in view of(26), and so I 2 r d by(33), as desired.…”
mentioning
confidence: 99%