2015
DOI: 10.1515/gmj-2015-0008
|View full text |Cite
|
Sign up to set email alerts
|

Shadowing and average shadowing properties for iterated function systems

Abstract: In this paper, we introduce the definitions of shadowing and average shadowing properties for iterated function systems and give some examples characterizing these definitions. We prove that an iterated function system has the shadowing property if and only if the step skew product corresponding to the iterated function system has the shadowing property. Also, we study some notions such as transitivity, chain transitivity, chain mixing and mixing for iterated function systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2016
2016
2022
2022

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(16 citation statements)
references
References 0 publications
0
16
0
Order By: Relevance
“…Remark 1.1. If IF S(F ) has the strong shadowing property, then every generator has the shadowing property but its converse is not true (see Example 1.5 in [11]).…”
Section: Theorem 12 If a Homeomorphism Of A Compact Metric Space Hamentioning
confidence: 99%
See 1 more Smart Citation
“…Remark 1.1. If IF S(F ) has the strong shadowing property, then every generator has the shadowing property but its converse is not true (see Example 1.5 in [11]).…”
Section: Theorem 12 If a Homeomorphism Of A Compact Metric Space Hamentioning
confidence: 99%
“…This implies the inverse of Theorem C is not true. Moreover, IF S({f 0 , f 1 }) dose not have the strong shadowing property (see Example 1.3 in [11]). So, the inverse of Theorem B does not hold.…”
Section: Proposition 27 If If S(f ) Has the Strong Shadowing Propermentioning
confidence: 99%
“…[3,4,8,9,11,15]. Over the last decade, shadowing and chaos for iterated function systems, have gained a lot of attention by many researchers and various interesting results have been obtained [1,2,7,13,19,20,22].…”
Section: Introductionmentioning
confidence: 99%
“…Ahn et al [2] introduced the notion of persistent actions for finitely generated group action on compact metric spaces and studied its relation to the topological stability. Bahabadi [5] discussed the shadowing and average shadowing properties for iterated function systems. Wu et al [26] further studied some chain properties and average shadowing for iterated function systems and proved that an iterated function system with (asymptotic) average shadowing is chain mixing.…”
Section: Introductionmentioning
confidence: 99%