2007
DOI: 10.1016/j.topol.2007.03.003
|View full text |Cite
|
Sign up to set email alerts
|

A classification of inverse limit spaces of tent maps with finite critical orbit

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 16 publications
(21 citation statements)
references
References 11 publications
0
21
0
Order By: Relevance
“…Let us denote by ℓ x p a link of C p which contains the point x. From [19] and [2] (for the finite and infinite critical orbit case, respectively) we have the following proposition: From [6,7] and [10] we can derive of the chain C p . Using this notation we can write Proposition 3.1 in the following way: h(x) ≈ p σ R (x) for every x ∈ E q .…”
Section: Construction Of Chains C P and C P+mmentioning
confidence: 99%
“…Let us denote by ℓ x p a link of C p which contains the point x. From [19] and [2] (for the finite and infinite critical orbit case, respectively) we have the following proposition: From [6,7] and [10] we can derive of the chain C p . Using this notation we can write Proposition 3.1 in the following way: h(x) ≈ p σ R (x) for every x ∈ E q .…”
Section: Construction Of Chains C P and C P+mmentioning
confidence: 99%
“…The result of Kailhofer has been substantially improved. Stimac [38] has shown that if the forward orbit of c is finite, then Ingram's Conjecture holds for those s. This, of course, includes the case that the forward orbit of c is periodic. Another result has been announced by Raines and Stimac dealing with the case that the critical point c is non-recurrent.…”
Section: Discussionmentioning
confidence: 99%
“…It is easy to see that p -bridges are p -symmetric, and that L p OEx B determines the q -folding pattern of the p -bridge B , for all q Ä p (see Lemma 3.8 in [29]). …”
Section: Preliminariesmentioning
confidence: 99%
“…Now we recall the definition of a family of chains of K s introduced in [29]. Let V n be the set of all allowed sequences of length n ordered by the parity-lexicographical ordering.…”
Section: Remark 218mentioning
confidence: 99%