اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Manneville map: topological, metric and algorithmic entropy
78
0
0.0
(
0
)
تأليف
Claudio Bonanno
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the Manneville map f(x)=x+x^z (mod 1), with z>1, from a computational point of view, studying the behaviour of the Algorithmic Information Content. In particular, we consider a family of piecewise linear maps that gives examples of algorithmic behaviour ranging from the fully to the mildly chaotic, and show that the Manneville map is a member of this family.
قيم البحث
اقرأ أيضاً
Let $X$ be a compact metric space and $T:Xlongrightarrow X$ be continuous. Let $h^*(T)$ be the supremum of topological sequence entropies of $T$ over all subsequences of $mathbb Z_+$ and $S(X)$ be the set of the values $h^*(T)$ for all continuous map
s $T$ on $X$. It is known that ${0} subseteq S(X)subseteq {0, log 2, log 3, ldots}cup {infty}$. Only three possibilities for $S(X)$ have been observed so far, namely $S(X)={0}$, $S(X)={0,log2, infty}$ and $S(X)={0, log 2, log 3, ldots}cup {infty}$. In this paper we completely solve the problem of finding all possibilities for $S(X)$ by showing that in fact for every set ${0} subseteq A subseteq {0, log 2, log 3, ldots}cup {infty}$ there exists a one-dimensional continuum $X_A$ with $S(X_A) = A$. In the construction of $X_A$ we use Cook continua. This is apparently the first application of these very rigid continua in dynamics. We further show that the same result is true if one considers only homeomorphisms rather than con-ti-nuous maps. The problem for group actions is also addressed. For some class of group actions (by homeomorphisms) we provide an analogous result, but in full generality this problem remains open. The result works also for an analogous class of semigroup actions (by continuous maps).
Let $(X, T)$ be a topological dynamical system (TDS), and $h (T, K)$ the topological entropy of a subset $K$ of $X$. $(X, T)$ is {it lowerable} if for each $0le hle h (T, X)$ there is a non-empty compact subset with entropy $h$; is {it hereditarily l
owerable} if each non-empty compact subset is lowerable; is {it hereditarily uniformly lowerable} if for each non-empty compact subset $K$ and each $0le hle h (T, K)$ there is a non-empty compact subset $K_hsubseteq K$ with $h (T, K_h)= h$ and $K_h$ has at most one limit point. It is shown that each TDS with finite entropy is lowerable, and that a TDS $(X, T)$ is hereditarily uniformly lowerable if and only if it is asymptotically $h$-expansive.
Let $(X, T)$ be a topological dynamical system. Denote by $h (T, K)$ and $h^B (T, K)$ the covering entropy and dimensional entropy of $Ksubseteq X$, respectively. $(X, T)$ is called D-{it lowerable} (resp. {it lowerable}) if for each $0le hle h (T, X
)$ there is a subset (resp. closed subset) $K_h$ with $h^B (T, K_h)= h$ (resp. $h (T, K_h)= h$); is called D-{it hereditarily lowerable} (resp. {it hereditarily lowerable}) if each Souslin subset (resp. closed subset) is D-lowerable (resp. lowerable). In this paper it is proved that each topological dynamical system is not only lowerable but also D-lowerable, and each asymptotically $h$-expansive system is D-hereditarily lowerable. A minimal system which is lowerable and not hereditarily lowerable is demonstrated.
Let $mathcal{M}(X)$ be the space of Borel probability measures on a compact metric space $X$ endowed with the weak$^ast$-topology. In this paper, we prove that if the topological entropy of a nonautonomous dynamical system $(X,{f_n}_{n=1}^{+infty})$
vanishes, then so does that of its induced system $(mathcal{M}(X),{f_n}_{n=1}^{+infty})$; moreover, once the topological entropy of $(X,{f_n}_{n=1}^{+infty})$ is positive, that of its induced system $(mathcal{M}(X),{f_n}_{n=1}^{+infty})$ jumps to infinity. In contrast to Bowens inequality, we construct a nonautonomous dynamical system whose topological entropy is not preserved under a finite-to-one extension.
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological entropy for t
his kind of systems turned out to be of computational nature. Part of the great importance of these symbolic systems relies on the role they have played in understanding more general systems over non-symbolic spaces. The aim of this article is to investigate topological entropy from a computability point of view in this more general, not necessarily symbolic setting. In analogy to effective subshifts, we consider computable maps over effective compact sets in general metric spaces, and study the computability properties of their topological entropies. We show that even in this general setting, the entropy is always a $Sigma_2$-computable number. We then study how various dynamical and analytical constrains affect this upper bound, and prove that it can be lowered in different ways depending on the constraint considered. In particular, we obtain that all $Sigma_2$-computable numbers can already be realized within the class of surjective computable maps over ${0,1}^{mathbb{N}}$, but that this bound decreases to $Pi_{1}$(or upper)-computable numbers when restricted to expansive maps. On the other hand, if we change the geometry of the ambient space from the symbolic ${0,1}^{mathbb{N}}$ to the unit interval $[0,1]$, then we find a quite different situation -- we show that the possible entropies of computable systems over $[0,1]$ are exactly the $Sigma_{1}$(or lower)-computable numbers and that this characterization switches down to precisely the computable numbers when we restrict the class of system to the quadratic family.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
