اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the nonchaotic nature of monotone dynamical systems
86
0
0.0
(
0
)
تأليف
Morris W. Hirsch
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Two types of dynamics, chaotic and monotone, are compared. It is shown that monotone maps in strongly ordered spaces do not have chaotic attracting sets.
قيم البحث
اقرأ أيضاً
In this paper, we study the Poisson stability (in particular, stationarity, periodicity, quasi-periodicity, Bohr almost periodicity, almost automorphy, recurrence in the sense of Birkhoff, Levitan almost periodicity, pseudo periodicity, almost recurr
ence in the sense of Bebutov, pseudo recurrence, Poisson stability) of motions for monotone nonautonomous dynamical systems and of solutions for some classes of monotone nonautonomous evolution equations (ODEs, FDEs and parabolic PDEs). As a byproduct, some of our results indicate that all the trajectories of monotone systems converge to the above mentioned Poisson stable trajectories under some suitable conditions, which is interesting in its own right for monotone dynamics.
Let X be a subset of R^n whose interior is connected and dense in X, ordered by a polyhedral cone in R^n with nonempty interior. Let T be a monotone homeomorphism of X whose periodic points are dense. Then T is periodic.
Assume that a Hamiltonian system is monotone. In this paper, we give several characterizations on when such a system is Anosov. Assuming that a monotone Hamiltonian system has no conjugate point, we show that there are two distributions which are inv
ariant under the Hamiltonian flow. We show that a monotone Hamiltonian flow without conjugate point is Anosov if and only if these distributions are transversal. We also show that if the reduced curvature of the Hamiltonian system is non-positive, then the flow is Anosov if and only if the reduced curvature is negative somewhere along each trajectory.
We propose a new framework for the study of continuous time dynamical systems on networks. We view such dynamical systems as collections of interacting control systems. We show that a class of maps between graphs called graph fibrations give rise to
maps between dynamical systems on networks. This allows us to produce conjugacy between dynamical systems out of combinatorial data. In particular we show that surjective graph fibrations lead to synchrony subspaces in networks. The injective graph fibrations, on the other hand, give rise to surjective maps from large dynamical systems to smaller ones. One can view these surjections as a kind of fast/slow variable decompositions or as abstractions in the computer science sense of the word.
Monomial mappings, $xmapsto x^n$, are topologically transitive and ergodic with respect to Haar measure on the unit circle in the complex plane. In this paper we obtain an anologous result for monomial dynamical systems over $p-$adic numbers. The pro
cess is, however, not straightforward. The result will depend on the natural number $n$. Moreover, in the $p-$adic case we never have ergodicity on the unit circle, but on the circles around the point 1.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
