Related papers: Symbolic dynamics: entropy = dimension = complexit…
A `symbolic dynamical system' is a continuous transformation F:X-->X of a closed perfect subset X of A^V, where A is a finite set and V is countable. (Examples include subshifts, odometers, cellular automata, and automaton networks.) The…
We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic…
In this paper, we mainly elucidate a close relationship between the topological entropy and mean dimension theory for actions of polynomial growth groups. We show that metric mean dimension and mean Hausdorff dimension of subshifts with…
A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…
We show that the image of a subshift $X$ under various injective morphisms of symbolic algebraic varieties over monoid universes with algebraic variety alphabets is a subshift of finite type, resp. a sofic subshift, if and only if so is…
This paper concerns the restricted 3-body problem. By applying topological methods we give a computer assisted proof of the existence of some classes of periodic orbits, the existence of symbolic dynamics and we give a rigorous lower…
Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomposition property, the topological entropy h(X) of X is…
Topological entropy is a measure of complex dynamics. In this regard, multimodal maps play an important role when it comes to study low-dimensional chaotic dynamics or explain some features of higher dimensional complex dynamics with…
We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…
Kolmogorov complexity of a finite binary word reflects both algorithmic structure and the empirical distribution of symbols appearing in the word. Words with symbol frequencies far from one half have smaller combinatorial richness and…
The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…
For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…
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…
We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…
Mean dimension is a topological invariant for dynamical systems that is meaningful for systems with infinite dimension and infinite entropy. Given a $\mathbb{Z}^k$-action on a compact metric space $X$, we study the following three problems…
The purpose of this article is to extend the earliest results of A.A. Brudno, connecting topological entropy of a subshift X over $\mathbb{N}$ to the Kolmogorov complexity of words in X, to subshifts over computable groups that posses…
For any non-erasing free monoid morphism $\sigma: \cal A^* \to \cal B^*$, and for any subshift $X \subset \cal A^\Z$ and its image subshift $Y = \sigma(X) \subset \cal B^\Z$, the associated complexity functions $p_X$ and $p_Y$ are shown to…
We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…
We prove that $\mathcal{C}^r$ maps with $r>1$ on a compact surface have symbolic extensions, i.e. topological extensions which are subshifts over a finite alphabet. More precisely we give a sharp upper bound on the so-called symbolic…
We use recent developments in local entropy theory to prove that chaos in dynamical systems implies the existence of complicated structure in the underlying space. Earlier Mouron proved that if $X$ is an arc-like continuum which admits a…