On \(\lambda\)-power distributional \(n\)-chaos (Q681055): Difference between revisions

Let \((X,f)\) be a dynamical system. The following are the main results in this paper. Theorem 1 (4.1 in the paper): The subshift \((X,\sigma)\) is uniformly 0-power distributionally \(n\)-chaotic, without any distributionally \((n+1)\)-scrambled tuple. Moreover, \((X,\sigma)\) is not 0-power distributionally \((n+1)\)-chaotic. Theorem 2 (5.1 and 5.2 in the paper): Let \(t\in \mathbb{Z}_+^{\mathbb{Z}_+}\) be given. Then, {\parindent=0.7cm\begin{itemize}\item[(i)] If, for \(\lambda\in (0,1]\), \(\lim_{k\rightarrow\infty} r_{k-1}^{(t)}/[t_k s_k^{(t)}]^\lambda=0\), then \((M^{(t)},\sigma)\) is uniformly \(\lambda\)-power distributionally \(n\)-chaotic \item[(ii)] If, for each \(\lambda\in (0,1]\), \(\lim_{k\rightarrow\infty} r_{k-1}^{(t)}/[t_k s_k^{(t)}]^\lambda=0\), then \((M^{(t)},\sigma)\) is uniformly 0-power distributionally \(n\)-chaotic. \end{itemize}} Further aspects occasioned by these developments are also discussed.