Related papers: Distributional chaotic generalized shifts

In the following text, for finite discrete $X$ with at least two elements, nonempty countable $\Gamma$, and $\varphi:\Gamma\to\Gamma$ we prove the generalized shift dynamical system $(X^\Gamma,\sigma_\varphi)$ is densely chaotic if and only…

In the following text for arbitrary $X$ with at least two elements, nonempty set $\Gamma$ and self-map $\varphi:\Gamma\to\Gamma$ we prove the set-theoretical entropy of generalized shift $\sigma_\varphi:X^\Gamma\to X^\Gamma$…

For a finite discrete topological space $X$ with at least two elements, a nonempty set $\Gamma$, and a map $\varphi:\Gamma\to\Gamma$, $\sigma_\varphi:X^\Gamma\to X^\Gamma$ with $\sigma_\varphi((x_\alpha)_{\alpha\in\Gamma})=…

In the following text we prove that for finite discrete $X$ with at least two elements and infinite $\Gamma$, the generalized shift transformation semigroup $({\mathcal S},X^\Gamma)$ is equicontinuous (resp. has at least an equicontinuous…

In this paper, for finite discrete field $F$, nonempty set $\Gamma$, weight vector $\mathfrak{w}=({\mathfrak w}_\alpha)_{\alpha\in\Gamma}\in F^\Gamma$ and weighted generalized shift $\sigma_{\varphi,{\mathfrak w}}:F^\Gamma\to F^\Gamma$, we…

In this paper for a finite field $F$, a nonempty set $\Gamma$, a self--map $\varphi:\Gamma\to\Gamma$ and a weight vector $\mathfrak{w}\in F^\Gamma$, we show that the set--theoretical entropy of the weighted generalized shift…

In the following text we introduce specification property (stroboscopical property) for dynamical systems on uniform space. We focus on two classes of dynamical systems: generalized shifts and dynamical systems with Alexandroff…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

For a set $\Gamma$, a function $\lambda:\Gamma\to \Gamma$ and a non-trivial abelian group $K$, the generalized shift $\sigma_\lambda:K^\Gamma\to K^\Gamma$ is defined by $(x_i)_{i\in \Gamma}\mapsto (x_{\lambda(i)})_{i\in\Gamma}$. In this…

The Gauss map (or continued fraction map) is an important dissipative one-dimensional discrete-time dynamical system that exhibits chaotic behaviour and which generates a symbolic dynamics consisting of infinitely many different symbols.…

In the following text for $p\in[1,\infty]$, nonzero cardinal number $\tau$, self--map $\varphi:\tau\to\tau$ if there exists $N\in\mathbb{N}$ such that $\varphi^{-1}(\alpha)$ has at most $N$ elements for each $\alpha<\tau$, and operators…

For every finite-to-one map $\lambda:\Gamma\to\Gamma$ and for every abelian group $K$, the generalized shift $\sigma_\lambda$ of the direct sum $\bigoplus_\Gamma K$ is the endomorphism defined by…

In this paper, we investigate the distributional chaos of the composition operator $T_{\varphi}:f\mapsto f\circ\varphi$ on $L^{p}(X,\mathcal{B},\mu)$, $1\leq p <\infty$. We provide a characterization and practical sufficient conditions on…

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…

We consider a general class of intermittent maps designed to be weakly chaotic, i.e., for which the separation of trajectories of nearby initial conditions is weaker than exponential. We show that all its spatio and temporal properties,…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…

A network of $N$ elements is studied in terms of a deterministic globally coupled map which can be chaotic. There exists a range of values for the parameters of the map where the number of different macroscopic configurations is very large,…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

Based on newly discovered properties of the shift map (Theorem 1), we believe that chaos should involve not only nearby points can diverge apart but also faraway points can get close to each other. Therefore, we propose to call a continuous…