Skip to content

Advertisement

Open Access

Weakly mixing sets and transitive sets for non-autonomous discrete systems

Advances in Difference Equations20142014:217

https://doi.org/10.1186/1687-1847-2014-217

Received: 15 May 2014

Accepted: 15 July 2014

Published: 4 August 2014

Abstract

In this paper we mainly study the weakly mixing sets and transitive sets of non-autonomous discrete systems. Some basic concepts are introduced for non-autonomous discrete systems, including a weakly mixing set and a transitive set. We discuss the basic properties of weakly mixing sets and transitive sets of non-autonomous discrete systems. Also, we investigate the relationship between two conjugated non-autonomous discrete systems on weakly mixing sets and transitive sets.

MSC:54H20, 37B20.

Keywords

non-autonomous discrete systemweakly mixing settransitive set

1 Introduction

Throughout this paper denotes the set of all positive integers, and let Z + = N { 0 } . Let X be a topological space, let f n : X X for each n N be a continuous map, and let f 1 , denote the sequence ( f 1 , f 2 , , f n , ) . The pair ( X , f 1 , ) is referred to as a non-autonomous discrete system [1]. Define
f 1 n ( x ) : = f n f n 1 f 2 f 1 , n N ,
and f 1 0 : = id X , the identity on X. In particular, when f 1 , is a constant sequence ( f , f , , f , ) , the pair ( X , f 1 , ) is just a classical discrete dynamical system (autonomous discrete dynamical system) ( X , f ) . The orbit initiated from x X under f 1 , is defined by the set
γ ( x , f 1 , ) = { x , f 1 ( x ) , f 1 2 ( x ) , , f 1 n ( x ) , } .

Its long-term behaviors are determined by its limit sets.

Topological transitivity, weak mixing and sensitive dependence on initial conditions (see [14]) are global characteristics of topological dynamical systems. Let ( X , f ) be a topological dynamical system. ( X , f ) is topologically transitive if for any nonempty open subsets U and V of X there exists n N such that f n ( U ) V . ( X , f ) is (topologically) mixing if for any nonempty open subsets U and V of X, there exists N N such that f n ( U ) V for all n N with n N . ( X , f ) is (topologically) weakly mixing if for any nonempty open subsets U 1 , U 2 , V 1 and V 2 of X, there exists n N such that f n ( U 1 ) V 1 and f n ( U 2 ) V 2 . It follows from these definitions that mixing implies weak mixing which in turn implies transitivity.

Blanchard introduced overall properties and partial properties in [5]. For example, sensitive dependence on initial conditions, Devaney chaos (see [6]), weak mixing, mixing and more belong to overall properties; Li-Yorke chaos (see [7]) and positive entropy (see [2, 8]) belong to partial properties. Weak mixing is an overall property, it is stable under semi-conjugate maps and implies Li-Yorke chaos. By [9], we know that a weakly mixing system always contains a dense uncountable scrambled set. In [10], Blanchard and Huang introduced the concepts of weakly mixing set and partial weak mixing, derived from a result given by Xiong and Yang [11] and showed that ‘partial weak mixing implies Li-Yorke chaos’ and ‘Li-Yorke chaos cannot imply partial weak mixing’. Let A be a closed subset of X but not a singleton. Then A is a weakly mixing set of X if and only if for any k N , any choice of nonempty open subsets V 1 , V 2 , , V k of A and nonempty open subsets U 1 , U 2 , , U k of X with A U i , i = 1 , 2 , , k , there exists m N such that f m ( V i ) U i for 1 i k . ( X , f ) is called partial weak mixing if X contains a weakly mixing subset. Next, Oprocha and Zhang [12] extended the notion of weakly mixing set and gave the concept of ‘transitive set’ and discussed its basic properties. Let A be a nonempty subset of X. A is called a transitive set of ( X , f ) if for any choice of a nonempty open subset V A of A and a nonempty open subset U of X with A U , there exists n N such that f n ( V A ) U .

In past ten years, a large number of papers have been devoted to dynamical properties in non-autonomous discrete systems. Kolyada and Snoha [1] gave the definition of topological entropy in non-autonomous discrete systems; Kolyada et al. [13] discussed minimality of non-autonomous discrete systems; Kempf [14] and Canovas [15] studied ω-limit sets in non-autonomous discrete systems. Krabs [16] discussed stability in non-autonomous discrete systems; Huang et al. [17, 18] studied topological pressure and pre-image entropy of non-autonomous discrete systems. Shi and Chen [19] and Oprocha and Wilczynski [20] and Canovas [21] discussed chaos in non-autonomous discrete systems, respectively. Kuang and Cheng [22] studied fractal entropy of non-autonomous systems. In this paper, we extend the notions of weakly mixing set and transitive set and give the definitions of transitive set and weakly mixing set for a non-autonomous discrete system. We discuss the basic properties of weakly mixing sets and transitive sets for non-autonomous discrete systems. Moreover, we investigate the weakly mixing sets and transitive sets for the conjugated non-autonomous discrete systems and obtain that if a system has a transitive set (a weakly mixing set), then the conjugated system has a transitive set (a weakly mixing set).

2 Preliminaries

In the present paper, A ¯ and int ( A ) denote the closure and interior of the set A, respectively. f 1 n denotes f n f n 1 f 2 f 1 , i.e., f 1 n = f n f n 1 f 2 f 1 for any n N . We define
( f k ) n = f k f k f k n

for any k , n N .

A non-autonomous discrete dynamical system ( X , f 1 , ) is said to be point transitive if there exists a point x X , the orbit of x is dense in X, i.e., γ ( x , f 1 , ) ¯ = X , and x is called a transitive point of ( X , f 1 , ) . ( X , f 1 , ) is said to be topologically transitive if for any two nonempty open sets U and V of X, there exists k N such that f 1 k ( U ) V . ( X , f 1 , ) is said to be weakly mixing if for any nonempty open sets U i and V i of X for i = 1 , 2 , there exists k N such that f 1 k ( U i ) V i for i = 1 , 2 .

Definition 2.1 [13]

Let ( X , f 1 , ) be a non-autonomous discrete system. The set A X is said to be invariant if f 1 n ( A ) A for any n N .

Definition 2.2 Let ( X , f 1 , ) be a non-autonomous discrete system and A be a nonempty closed subset of X. A is called a transitive set of ( X , f 1 , ) if for any choice of a nonempty open set V A of A and a nonempty open set U of X with A U , there exists n N such that f 1 n ( V A ) U .

Remark If ( X , f 1 , ) is topologically transitive, then X is a transitive set of ( X , f 1 , ) .

Definition 2.3 Let ( X , f 1 , ) be a non-autonomous discrete system and A be a nonempty closed subset of X but not a singleton. A is called a weakly mixing set of ( X , f 1 , ) if for any k N , any choice of nonempty open subsets V 1 A , V 1 A , , V k A of A and nonempty open subsets U 1 , U 2 , , U k of X with A U i , i = 1 , 2 , , k , there exists n N such that f 1 n ( V i A ) U i for each 1 i k .

According to the definitions of transitive set and weakly mixing set of a non-autonomous discrete system, we have the following results.

Result 1. If A is a weakly mixing set of ( X , f 1 , ) , then A is a transitive set of ( X , f 1 , ) .

Result 2. If a X is a transitive point of ( X , f 1 , ) , then { a } is a transitive set of ( X , f 1 , ) .

Example 2.1 Let
f n ( x ) = { 2 n n 2 x if  0 x n 2 2 n , 1 if  n 2 2 n x n + 2 2 n , 2 n n 2 ( 1 x ) if  n + 2 2 n x 1 , n = 3 , 4 ,

and f 1 = f 2 = id , the identity on [ 0 , 1 ] .

Observe that the given sequence converges uniformly to the tent map
f ( x ) = { 2 x if  0 x 1 2 , 2 ( 1 x ) if  1 2 x 1 ,

which is known to be topologically transitive on I = [ 0 , 1 ] from [6, 8]. We can easily prove that [ 0 , 1 2 ] is a transitive set of ( X , f 1 , ) .

Figure 1 and Figure 2 denote the tent map f and the 2nd iterate f 2 of the tent map f, respectively.
Figure 1

The tent map f .

Figure 2

The 2nd iterate f 2 of the tent map f .

Definition 2.4 [23]

Let ( X , τ ) be a topological space and A be a nonempty set of X. A is a regular closed set of X if A = int ( A ) ¯ .

We easily prove that A is a regular closed set if and only if int ( V A ) for any nonempty set V A of A.

Definition 2.5 [24]

Let ( X , τ ) be a topological space. A and B are two nonempty subsets of X. B is dense in A if A A B ¯ .

In fact, we easily prove that B is dense in A if and only if V A B for any nonempty open set V A of A.

3 Main results

In this section, we discuss the properties of transitive sets and weakly mixing sets for non-autonomous discrete systems.

Proposition 3.1 Let ( X , f 1 , ) be a non-autonomous discrete system and A be a nonempty closed set of X. Then the following conditions are equivalent.
  1. (1)

    A is a transitive set of ( X , f 1 , ) .

     
  2. (2)

    Let V A be a nonempty open subset of A and U be a nonempty open subset of X with A U . Then there exists n N such that V A ( f 1 n ) 1 ( U ) .

     
  3. (3)

    Let U be a nonempty open set of X with U A . Then n N ( f 1 n ) 1 ( U ) is dense in A.

     
Proof (1) (2) Let A be a transitive set of ( X , f 1 , ) . Then, for any choice of a nonempty open set V A of A and a nonempty open set U of X with A U , there exists n N such that f 1 n ( V A ) U . Since f 1 n ( V A ( f 1 n ) 1 ( U ) ) = f 1 n ( V A ) U , it follows that V A ( f 1 n ) 1 ( U ) .
  1. (2)
    (3) Let V A be any nonempty open set of A and U be a nonempty open set of X with A U . By the assumption of (2), there exists n N such that V A ( f 1 n ) 1 U . Furthermore, we have
    V A n N ( f 1 n ) 1 U = n N ( V A ( f 1 n ) 1 ( U ) ) .
     
Therefore, n N ( f 1 n ) 1 ( U ) is dense in A.
  1. (3)

    (1) Let V A be any nonempty open set of A and U be a nonempty open set of X with A U . Since n N ( f 1 n ) 1 ( U ) is dense in A, it follows that V A n N ( f 1 n ) 1 ( U ) . Furthermore, there exists n N such that V A ( f 1 n ) 1 ( U ) . As f 1 n ( V A ( f 1 n ) 1 ( U ) ) = f 1 n ( V A ) U , we have f 1 n ( V A ) U . Therefore, A is a transitive set of ( X , f 1 , ) . □

     
Corollary 3.1 Let ( X , f ) be a classical dynamical system and A be a nonempty closed set of X. Then the following conditions are equivalent.
  1. (1)

    A is a transitive set of ( X , f ) .

     
  2. (2)

    Let V A be a nonempty open subset of A and U be a nonempty open subset of X with A U . Then there exists n N such that V A f n ( U ) .

     
  3. (3)

    Let U be a nonempty open set of X with A U . Then n N f n ( U ) is dense in A.

     
Proposition 3.2 Let ( X , f 1 , ) be a non-autonomous discrete system, where ( X , d ) is a metric space and A is a nonempty closed subset of X. Then the following conditions are equivalent.
  1. (1)

    A is a transitive set of ( X , f 1 , ) .

     
  2. (2)

    Let a , x A and ε , δ > 0 . Then there exists n N such that ( A B ( a , ε ) ) ( f 1 n ) 1 ( B ( x , ε ) ) .

     
  3. (3)

    Let a , x A and ε > 0 . Then there exists n N such that ( A B ( a , ε ) ) ( f 1 n ) 1 ( B ( x , ε ) ) .

     
Proof (1) (2) By the definition of transitive set, (2) is obtained easily.
  1. (2)

    (3) Obviously.

     
  2. (3)

    (1) Let V A be any nonempty open set of A and U be a nonempty open set of X with A U , then there exist a , x A and ε > 0 such that A B ( a , ε ) V A and B ( x , ε ) U . By the assumption of (3), there exists n N such that ( A B ( a , ε ) ) ( f 1 n ) 1 ( B ( x , ε ) ) , further, V A ( f 1 n ) 1 ( U ) . Therefore, A is a transitive set of ( X , f 1 , ) . □

     
Proposition 3.3 Let ( X , f 1 , ) be a non-autonomous discrete system and A is a transitive set of ( X , f 1 , ) . Then:
  1. (1)

    U is dense in A if U is a nonempty open set of X satisfying A U and ( f 1 n ) 1 ( U ) U for every n N .

     
  2. (2)

    E = A or E is nowhere dense in A if E is a closed invariant subset of X and E A .

     
  3. (3)

    n N f 1 n ( A ) is dense in A if A is a regular closed set of X.

     
Proof (1) Since ( f 1 n ) 1 ( U ) U for every n N , we have n N ( f 1 n ) 1 ( U ) U . By Proposition 3.1, we have that U is dense in A.
  1. (2)
    Let E A . Since E is a closed set of X and E A , it follows that U = X E is an open set of X and U A . Moreover, E is an invariant subset of X, we have f 1 n ( E ) E for every n N . Furthermore,
    ( f 1 n ) 1 ( U ) = ( f 1 n ) 1 ( X E ) = ( f 1 n ) 1 ( X ) ( f 1 n ) 1 ( E ) X E = U for every  n N .
     
By the result of (1), U is dense in A. Therefore, E is nowhere dense in A.
  1. (3)

    Let V A be a nonempty open set of A. Since A is a regular closed set of X, it follows that int ( V A ) and int ( A ) . Moreover, A is a transitive set of ( X , f 1 , ) , there exists n N such that f 1 n ( int ( A ) ) int ( V A ) . Furthermore, we have f 1 n ( A ) V A , which implies that n N f 1 n ( A ) is dense in A. □

     

Theorem 3.1 Let ( X , f 1 , ) be a non-autonomous discrete system and A be a nonempty closed invariant set of X. Then A is a transitive set of ( X , f 1 , ) if and only if ( A , f 1 , ) is topologically transitive.

Proof Necessity. Let V A and U A be two nonempty open subsets of A. For a nonempty open subset U A of A, there exists an open set U of X such that U A = U A . Since A is a transitive set of ( X , f 1 , ) , there exists n N such that f 1 n ( V A ) U . Moreover, A is invariant, i.e., f 1 n ( A ) A for every n N , which implies that f 1 n ( V A ) A . Therefore, f 1 n ( V A ) A U , i.e., f 1 n ( V A ) U A . This shows that ( A , f 1 , ) is topologically transitive.

Sufficiency. Let V A be a nonempty open set of A and U be a nonempty open set of X with A U . Since U is an open set of X and A U , it follows that U A is a nonempty open set of A. As ( A , f 1 , ) is topologically transitive, there exists n N such that f 1 n ( V A ) ( U A ) , which implies that f 1 n ( V A ) U . This shows that A is a transitive set of ( X , f 1 , ) . □

Theorem 3.2 Let ( X , f 1 , ) be topologically transitive and A be a regular closed set of X. Then A is a transitive set of ( X , f 1 , ) .

Proof Let V A be a nonempty set of A and U be a nonempty set of X with A U . Since A is a regular closed set and ( X , f 1 , ) is topologically transitive, there exists n N such that f 1 n ( int ( V A ) ) U , which implies that f 1 n ( V A ) U . Therefore, A is a transitive set of ( X , f 1 , ) . □

Corollary 3.2 Let ( X , f 1 , ) be a non-autonomous discrete system. Then ( X , f 1 , ) is topologically transitive if and only if every nonempty regular closed set of X is a transitive set of ( X , f 1 , ) .

Definition 3.1 Let ( X , f 1 , ) and ( Y , g 1 , ) be two non-autonomous discrete systems, and let h : X Y be a continuous map and
g n ( h ( x ) ) = h ( f n ( x ) ) for any  n N , x X .
  1. (1)

    If h : X Y is a surjective map, then f 1 , and g 1 , are said to be topologically semi-conjugate.

     
  2. (2)

    If h : X Y is a homeomorphism, then f 1 , and g 1 , are said to be topologically conjugate.

     

Example 3.1 Let f n : R R with f n ( x ) = n x for all n N and x R , where R is a real line, and g n : S 1 S 1 with g n ( e i θ ) = e i n θ for all n N , where S 1 is the unite circle. Define h : R S 1 by h ( x ) = e 2 π i x . It can be easily verified that h is a continuous surjective map and h f n = g n h . Therefore, ( R , f 1 , ) and ( S 1 , g 1 , ) are topologically semi-conjugate.

Theorem 3.3 Let ( X , f 1 , ) and ( Y , g 1 , ) be two non-autonomous discrete systems, and let h : X Y be a semi-conjugate map. A is a nonempty closed subset of X and h ( A ) is a closed subset of Y. Then:
  1. (1)

    If A is a transitive set of ( X , f 1 , ) , then h ( A ) is a transitive set of ( Y , g 1 , ) .

     
  2. (2)

    If A is a weakly mixing set of ( X , f 1 , ) and h ( A ) is not a singleton, then h ( A ) is a weakly mixing set of ( Y , g 1 , ) .

     
Proof (1) Let V h ( A ) be a nonempty open set of h ( A ) and U be a nonempty open set of Y with h ( A ) U . Since h ( A ) is a subspace of Y, there exists an open set V of Y such that V h ( A ) = V h ( A ) . Furthermore,
A h 1 ( V h ( A ) ) = A h 1 ( V h ( A ) ) = A h 1 ( V ) .
Hence, A h 1 ( V h ( A ) ) is an open subset of A. Since
h ( A h 1 ( V h ( A ) ) ) = h ( A ) V h ( A ) = V h ( A ) ,
then we have A h 1 ( V h ( A ) ) . Moreover, U h ( A ) , which implies that h 1 ( U ) A . Since A is a transitive set of ( X , f 1 , ) , there exists n N such that h 1 ( V h ( A ) ) A ( f 1 n ) 1 ( h 1 ( U ) ) . As h is a semi-conjugate map, i.e., g k ( h ( x ) ) = h ( f k ( x ) ) for every k N , x X , we have h 1 ( g k ) 1 ( x ) = ( f k ) 1 h 1 ( x ) for every k N , x X . Therefore, h 1 ( V h ( A ) ( g 1 n ) 1 ( U ) ) , which implies that V h ( A ) ( g 1 n ) 1 U . This shows that h ( A ) is a transitive set of ( Y , g 1 , ) .
  1. (2)
    Suppose that A is a weakly mixing set of ( X , f 1 , ) and h ( A ) is a closed subset of Y but not a singleton. Fix k N . If V 1 h ( A ) , V 2 h ( A ) , , V k h ( A ) are nonempty open subsets of h ( A ) and U 1 , U 2 , , U k are nonempty open subsets of Y with h ( A ) U i , i = 1 , 2 , , k . Since h ( A ) is a subspace of Y, there exists an open subset V i of Y such that V i h ( A ) = V i h ( A ) for each i = 1 , 2 , , k . But
    A h 1 ( V i h ( A ) ) = A h 1 ( V i h ( A ) ) = A h 1 ( V i ) ,
     
then A h 1 ( V i h ( A ) ) ( i = 1 , 2 , , k ) are open subsets of A. Since
h ( A h 1 ( V i h ( A ) ) ) = h ( A ) V i h ( A ) = V i h ( A ) ,

it follows that A h 1 ( V i h ( A ) ) for each i = 1 , 2 , , k . Furthermore, h 1 ( U i ) is a nonempty open subset of X with h 1 ( U i ) A for each i = 1 , 2 , , k . Since A is a weakly mixing set of ( X , f 1 , ) , there exists n N such that ( h 1 ( V i h ( A ) ) A ) ( f 1 n ) 1 ( h 1 ( U i ) ) . As h is a semi-conjugate map, i.e., g m ( h ( x ) ) = h ( f m ( x ) ) for every m N , x X , we have h 1 ( g m ) 1 ( x ) = ( f m ) 1 h 1 ( x ) for every m N , x X . Furthermore, h 1 ( V i h ( A ) ( g 1 n ) 1 U i ) for each i = 1 , 2 , , k , which implies that V i h ( A ) ( g 1 n ) 1 U i for each i = 1 , 2 , , k . This shows that h ( A ) is a weakly mixing set of ( Y , g 1 , ) . □

Corollary 3.3 Let ( X , f 1 , ) and ( Y , g 1 , ) be two non-autonomous discrete systems, and let h : X Y be a conjugate map. Then:
  1. (1)

    ( X , f 1 , ) has a transitive set if and only if so is ( Y , g 1 , ) .

     
  2. (2)

    ( X , f 1 , ) has a weakly mixing set if and only if so is ( Y , g 1 , ) .

     

Definition 3.2 Let ( X , f 1 , ) be a non-autonomous discrete system. f 1 , is a k-periodic discrete system if there exists k Z + such that f n + k ( x ) = f n ( x ) for any x X and n Z + .

Let ( X , f 1 , ) be a k-periodic discrete system for any k Z + . Define g = : f k f k 1 f 1 , we say that ( X , g ) is an induced autonomous discrete system by a k-periodic discrete system ( X , f 1 , ) .

From Definition 3.2, we easily obtain the following proposition.

Proposition 3.4 Let ( X , f 1 , ) be a k-periodic non-autonomous discrete system where ( X , d ) is a metric space, g = f k f k 1 f 1 , ( X , g ) is its induced autonomous discrete system. Then:
  1. (1)

    If ( X , g ) has a transitive set, then so is ( X , f 1 , ) .

     
  2. (2)

    If ( X , g ) has a weakly mixing set, then so is ( X , f 1 , ) .

     

Declarations

Acknowledgements

The authors would like to thank the referees for many valuable and constructive comments and suggestions for improving this paper. This work was supported by the Education Department Foundation of Henan Province (13A110832, 14B110006), P.R. China.

Authors’ Affiliations

(1)
School of Mathematics and Information Science, Shangqiu Normal University, Shangqiu, Henan, China
(2)
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, China

References

  1. Kolyada S, Snoha L: Topological entropy of nonautonomous dynamical systems. Random Comput. Dyn. 1996, 4: 205-233.MathSciNetMATHGoogle Scholar
  2. Block LS, Coppel WA Lecture Notes in Mathematics 1513. In Dynamics in One Dimension. Springer, Berlin; 1992.Google Scholar
  3. Robinson C: Dynamical Systems: Stability, Symbolic Dynamics, and Chaos. 2nd edition. CRC Press, Boca Raton; 1999.MATHGoogle Scholar
  4. Walters P Texts in Math. 79. In An Introduction to Ergodic Theory. Springer, New York; 1982.View ArticleGoogle Scholar
  5. Blanchard F: Topological chaos: what may this mean? J. Differ. Equ. Appl. 2009, 15: 23-46. 10.1080/10236190802385355MathSciNetView ArticleMATHGoogle Scholar
  6. Devaney RL: An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Redwood City; 1989.MATHGoogle Scholar
  7. Li TY, Yorke J: Period three implies chaos. Am. Math. Mon. 1975, 82: 985-992. 10.2307/2318254MathSciNetView ArticleMATHGoogle Scholar
  8. Ruette, S: Chaos for continuous interval maps: a survey of relationship between the various sorts of chaos. http://www.math.u-psud.fr/~ruette/Google Scholar
  9. Iwanik A: Independence and scrambled sets for chaotic mapping. In The Mathematical Heritage of C.F. Gauss. World Scientific, River Edge; 1991:372-378.View ArticleGoogle Scholar
  10. Blanchard F, Huang W: Entropy sets, weakly mixing sets and entropy capacity. Discrete Contin. Dyn. Syst. 2008, 20: 275-311.MathSciNetMATHGoogle Scholar
  11. Xiong J, Yang Z: Chaos caused by a topologically mixing map. Advanced Series in Dynamical Systems 9. In Dynamical Systems and Related Topics. World Scientific, Singapore; 1991:550-572.Google Scholar
  12. Oprocha P, Zhang G: On local aspects of topological weak mixing in dimension one and beyond. Stud. Math. 2011, 202: 261-288. 10.4064/sm202-3-4MathSciNetView ArticleMATHGoogle Scholar
  13. Kolyada S, Snoha L, Trofimchuk S: On minimality of nonautonomous dynamical systems. Nonlinear Oscil. 2004, 7: 83-89.MathSciNetView ArticleGoogle Scholar
  14. Kempf R: On Ω-limit sets of discrete-time dynamical systems. J. Differ. Equ. Appl. 2002, 8: 1121-1131. 10.1080/10236190290029024MathSciNetView ArticleMATHGoogle Scholar
  15. Canovas JS: On ω -limit sets of non-autonomous discrete systems. J. Differ. Equ. Appl. 2006, 12: 95-100. 10.1080/10236190500424274MathSciNetView ArticleMATHGoogle Scholar
  16. Krabs W: Stability and controllability in non-autonomous time-discrete dynamical systems. J. Differ. Equ. Appl. 2002, 8: 1107-1118. 10.1080/1023619021000053971MathSciNetView ArticleMATHGoogle Scholar
  17. Huang X, Wen X, Zeng F: Topological pressure of nonautonomous dynamical systems. Nonlinear Dyn. Syst. Theory 2008, 8: 43-48.MathSciNetMATHGoogle Scholar
  18. Huang X, Wen X, Zeng F: Pre-image entropy of nonautonomous dynamical systems. J. Syst. Sci. Complex. 2008, 21: 441-445. 10.1007/s11424-008-9125-7MathSciNetView ArticleMATHGoogle Scholar
  19. Shi Y, Chen G: Chaos of time-varying discrete dynamical systems. J. Differ. Equ. Appl. 2009, 15: 429-449. 10.1080/10236190802020879View ArticleMathSciNetMATHGoogle Scholar
  20. Oprocha P, Wilczynski P: Chaos in nonautonomous dynamical systems. An. Univ. ‘Ovidius’ Constanţa, Ser. Mat. 2009, 17: 209-221.MathSciNetMATHGoogle Scholar
  21. Canovas JS: Li-Yorke chaos in a class of non-autonomous discrete systems. J. Differ. Equ. Appl. 2011, 17: 479-486. 10.1080/10236190903049025MathSciNetView ArticleMATHGoogle Scholar
  22. Kuang R, Cheng W: Li-Yorke chaos in a class of non-autonomous discrete systems. J. Differ. Equ. Appl. 2011, 17: 479-486. 10.1080/10236190903049025View ArticleGoogle Scholar
  23. Dickman RF Jr.: Regular closed maps. Proc. Am. Math. Soc. 1973, 39: 414-416. 10.1090/S0002-9939-1973-0315654-1MathSciNetView ArticleMATHGoogle Scholar
  24. Engelking R: General Topology. Panstwowe Wydawnictwo Naukove, Warsaw; 1977.MATHGoogle Scholar

Copyright

© Liu and Sun; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.