scholarly journals The structure of \begin{document}$ \omega $\end{document}-limit sets of asymptotically non-autonomous discrete dynamical systems

2020 ◽  
Vol 25 (3) ◽  
pp. 903-915
Author(s):  
Emma D'Aniello ◽  
◽  
Saber Elaydi ◽  
1999 ◽  
Vol 09 (09) ◽  
pp. 1719-1729 ◽  
Author(s):  
LLUÍS ALSEDÀ ◽  
MOIRA CHAS ◽  
JAROSLAV SMÍTAL

We introduce the notion of the center of a point for discrete dynamical systems and we study its properties for continuous interval maps. It is known that the Birkhoff center of any such map has depth at most 2. Contrary to this, we show that if a map has positive topological entropy then, for any countable ordinal α, there is a point xα∈I such that its center has depth at least α. This improves a result by [Sharkovskii, 1966].


Entropy ◽  
2021 ◽  
Vol 23 (5) ◽  
pp. 616
Author(s):  
Marek Berezowski ◽  
Marcin Lawnik

Research using chaos theory allows for a better understanding of many phenomena modeled by means of dynamical systems. The appearance of chaos in a given process can lead to very negative effects, e.g., in the construction of bridges or in systems based on chemical reactors. This problem is important, especially when in a given dynamic process there are so-called hidden attractors. In the scientific literature, we can find many works that deal with this issue from both the theoretical and practical points of view. The vast majority of these works concern multidimensional continuous systems. Our work shows these attractors in discrete systems. They can occur in Newton’s recursion and in numerical integration.


2021 ◽  
pp. 1-11
Author(s):  
STEPHEN JACKSON ◽  
BILL MANCE ◽  
SAMUEL ROTH

Abstract We consider the complexity of special $\alpha $ -limit sets, a kind of backward limit set for non-invertible dynamical systems. We show that these sets are always analytic, but not necessarily Borel, even in the case of a surjective map on the unit square. This answers a question posed by Kolyada, Misiurewicz, and Snoha.


1993 ◽  
Vol 03 (02) ◽  
pp. 293-321 ◽  
Author(s):  
JÜRGEN WEITKÄMPER

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.


Sign in / Sign up

Export Citation Format

Share Document