Related papers: Symbolic dynamics: entropy = dimension = complexit…

The Kolmogorov-Sinai (K-S) entropy is a central measure of complexity and chaos. Its calculation for many-body systems is an interesting and important challenge. In this paper, the evaluation is formulated by considering $N$-dimensional…

The Shannon entropy of a random variable $X$ has much behaviour analogous to a signed measure. Previous work has concretized this connection by defining a signed measure $\mu$ on an abstract information space $\tilde{X}$, which is taken to…

Let $M$ be a closed, oriented, and connected Riemannian $n$-manifold, for $n\ge 2$, which is not a rational homology sphere. We show that, for a non-constant and non-injective uniformly quasiregular self-map $f\colon M\to M$, the…

To study arithmetic structures of natural numbers, we introduce a notion of entropy of arithmetic functions, called anqie entropy. This entropy possesses some crucial properties common to both Shannon's and Kolmogorov's entropies. We show…

A dynamical system is a pair $(X,G)$, where $X$ is a compact metrizable space and $G$ is a countable group acting by homeomorphisms of $X$. An endomorphism of $(X,G)$ is a continuous selfmap of $X$ which commutes with the action of $G$. One…

We prove in this text a characterization of the possible entropy dimensions of minimal tridimensional subshifts of finite type with a computability condition, using Goldbach's theorem on Fermat numbers.

The topological entropy dimension is mainly used to distinguish the zero topological entropy systems. Two types of topological entropy dimensions, the classical entropy dimension and the Pesin entropy dimension, are investigated for…

For a polycyclic group $\Lambda$, $\text{rank} (\Lambda )$ is defined as the number of $\mathbb{Z}$ factors in a polycyclic decomposition of $\Lambda$. For a finitely generated group $G$, $\text{rank} (G)$ is defined as the infimum of $…

A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…

For a topological dynamical system $(X, T)$ we define a uniform generator as a finite measurable partition such that the symmetric cylinder sets in the generated process shrink in diameter uniformly to zero. The problem of existence and…

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…

Inspired by the recent work of Glasner, Huang, Shao, Weiss and Ye, we prove that the maximal $\infty$-step pro-nilfactor $X_\infty$ of a minimal system $(X,T)$ is the topological characteristic factor along polynomials in a certain sense.…

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

We introduce a novel quantity for general dynamical systems, which we call the asymptotic uniform complexity. We prove an inequality relating the asymptotic uniform complexity of a dynamical system to its mean topological matching number.…

We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…

In direct response to requests for a logico-mathematical test of the conjecture, we formally disprove a recently conjectured artificial intelligence trade-off between epistemic certainty and scope in its published universal hyperbolic…

We consider infinite sequences of superstable orbits (cascades) generated by systematic substitutions of letters in the symbolic dynamics of one-dimensional nonlinear systems in the logistic map universality class. We identify the…

For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…

We generalize Brudno's theorem of $1$-dimensional shift dynamical system to $\mathbb{Z}^d$ (or $\mathbb{Z}_+^d$) subshifts. That is to say, in $\mathbb{Z}^d$ (or $\mathbb{Z}^d_+$) subshift, the Kolmogorov-Sinai entropy is equivalent to the…

We study the directional entropy of the dynamical system associated to a $\Z^2$ configuration in a finite alphabet. We show that under local assumptions on the complexity, either every direction has zero topological entropy or some…