In this paper, we investigate dynamical properties of monoid actions on symbolic systems. First, we establish mixing properties and an entropy formula for such actions. To describe chaotic behavior, we introduce and distinguish several types of Li–Yorke chaos. Our main result shows that positive entropy is equivalent to locally Li–Yorke chaos, a notion that strengthens the classical definition of Li–Yorke chaos.

We consider a subshift of finite type endowed with a Markov measure that is given by a stochastic matrix. We introduce a Markov hole determined by a finite collection of allowed words in the subshift. We first present a simple yet precise formula to compute the escape rate into the hole as the spectral radius of a perturbed stochastic matrix, where the rule of perturbation is governed by the hole. The combinatorial nature of the subshift comes to our aid in obtaining another formulation of the escape rate as the logarithm of the smallest real pole of a certain rational function, by way of recurrence relations. This proves crucial in comparing the escape rates into cylinders based at words of fixed length. Merits of both the formulas are illustrated through examples.

In 2002, Kamae and Zamboni [Ergod. Th. & Dynam. Sys. 22(4) (2002), 1191–1199] introduced maximal pattern complexity and determined that any aperiodic sequence must have maximal pattern complexity at least $2k$. In 2006, Kamae and Rao [European J. Combin. 27(1) (2006), 125–137] examined the maximal pattern complexity of sequences over larger alphabets and showed that sequences which have maximal pattern complexity less than $\ell k$, for $\ell $ the size of the alphabet, must have some periodic structure. In this paper, we investigate the structure of sequences of low maximal pattern complexity over $\ell $ letters, where $\liminf _{k \to \infty } p_{\alpha }^*(k) - 3k = -\infty $. In addition, we show that the minimal maximal pattern complexity of an aperiodic sequence which uses all $\ell $ letters is $p_{\alpha }^*(k) = 2k + \ell -2$ and give an exact structure for aperiodic sequences with this maximal pattern complexity.

We examine the convergence of ergodic averages along polynomials in Toeplitz systems and prove that it is possible for averages along one polynomial to converge, and along another to diverge. We also study the density of the polynomial orbits in Toeplitz systems—we show that it implies equidistribution of the polynomial orbits in the class of regular Toeplitz systems, but not in the class of strictly ergodic ones.

In this article, we study the pressure at infinity of potentials defined over countable Markov shifts. We establish an upper semi-continuity result concerning the limiting behaviour of the pressure of invariant probability measures, where the escape of mass is controlled by the pressure at infinity. As a consequence, we establish criteria for the existence of equilibrium states and maximizing measures for uniformly continuous potentials. Additionally, we study the pressure at infinity of suspension flows defined over countable Markov shifts and prove an upper semi-continuity result for the pressure map.

An avoshift is a subshift where for each set C from a suitable family of subsets of the shift group, the set of all possible valid extensions of a globally valid pattern on C to the identity element is determined by a bounded subpattern. This property is shared (for various families of sets C) by, for example, cellwise quasigroup shifts, totally extremally permutive (TEP) subshifts, and subshifts of finite type (SFTs) with a safe symbol. In this paper, we concentrate on avoshifts on polycyclic groups, when the sets C are what we call ‘inductive intervals’. We show that then, avoshifts are a recursively enumerable subset of subshifts of finite type. Furthermore, we can effectively compute lower-dimensional projective subdynamics and certain factors (avofactors), and we can decide equality and inclusion for subshifts in this class. These results were previously known for group shifts, but our class also covers many non-algebraic examples as well as many SFTs without dense periodic points. The theory also yields new proofs of decidability of inclusion for SFTs on free groups, and SFTness of subshifts with the topological strong spatial mixing property.

Given a weakly almost additive sequence of continuous functions with bounded variation ${\mathcal {F}}=\{\log f_n\}_{n=1}^{\infty }$ on a subshift X over finitely many symbols, we study properties of a function f on X such that $\lim _{n\to \infty }({1}/{n})\int \log f_n\,d\mu =\int f\,d\mu $ for every invariant measure $\mu $ on X. Under some conditions, we construct a function f on X explicitly, and study a relation between the property of ${\mathcal {F}}$ and some particular types of f. As applications, we study images of Gibbs measures for continuous functions under one-block factor maps. We investigate a relation between the almost additivity of the sequences associated to relative pressure functions and the fiber-wise sub-positive mixing property of a factor map. For a special type of one-block factor maps between shifts of finite type, we study necessary and sufficient conditions for the image of a one-step Markov measure to be a Gibbs measure for a continuous function.

For upper semi-continuous potentials defined on shifts over countable alphabets, this paper ensures sufficient conditions for the existence of a maximizing measure. We resort to the concept of blur shift, introduced by T. Almeida and M. Sobottka as a compactification method for countable alphabet shifts consisting of adding new symbols given by blurred subsets of the alphabet. Our approach extends beyond the Markovian case to encompass more general countable alphabet shifts. In particular, we guarantee a convex characterization and compactness for the set of blur invariant probabilities with respect to the discontinuous shift map.

In this article, we prove that the set of well-approximable points $W_\varphi (z) = \{x \in X : d (f^n x, z ) < \varphi (n) \mathrm {\ for\ infinite\ } n \in \mathbb {N}^+\}$ in the shrinking targets problems is distributional chaotic of type 1 for systems with a weak form of the exponential specification property. We apply it to transitive Anosov systems, $\beta $-shifts, etc.

Given any strong orbit equivalence class of minimal Cantor systems and any cardinal number that is finite, countable, or the continuum, we show that there exists a minimal subshift within the class whose number of asymptotic components is exactly the given cardinal. For finite or countable ones, we explicitly construct such examples using $\mathcal {S}$-adic subshifts. We obtain the uncountable case by showing that any topological dynamical system with at most countably many asymptotic components has zero topological entropy. We also construct systems that have arbitrarily high subexponential word complexity, but only one asymptotic component. We deduce that within any strong orbit equivalence class, there exists a minimal subshift whose automorphism group is isomorphic to $\mathbb {Z}$.

Given $\beta>1$, let $T_\beta $ be the $\beta $-transformation on the unit circle $[0,1)$, defined by $T_\beta (x)=\beta x-\lfloor \beta x\rfloor $. For each $t\in [0,1)$, let $K_\beta (t)$ be the survivor set consisting of all $x\in [0,1)$ whose orbit $\{T^n_\beta (x): n\ge 0\}$ never enters the interval $[0,t)$. Kalle et al [Ergod. Th. & Dynam. Sys. 40(9) (2020), 2482–2514] considered the case $\beta \in (1,2]$. They studied the set-valued bifurcation set $\mathscr {E}_\beta :=\{t\in [0,1): K_\beta (t')\ne K_\beta (t)~\text { for all } t'>t\}$ and proved that the Hausdorff dimension function $t\mapsto \dim _H K_\beta (t)$ is a non-increasing Devil’s staircase. In a previous paper [Ergod. Th. & Dynam. Sys. 43(6) (2023), 1785–1828], we determined, for all $\beta \in (1,2]$, the critical value $\tau (\beta ):=\min \{t>0: \eta _\beta (t)=0\}$. The purpose of the present article is to extend these results to all $\beta>1$. In addition to calculating $\tau (\beta )$, we show that: (i) the function $\tau : \beta \mapsto \tau (\beta )$ is left-continuous on $(1,\infty )$ with right-hand limits everywhere, but has countably infinitely many discontinuities; (ii) $\tau $ has no downward jumps; and (iii) there exists an open set $O\subset (1,\infty )$, whose complement $(1,\infty )\setminus O$ has zero Hausdorff dimension, such that $\tau $ is real-analytic, strictly convex, and strictly decreasing on each connected component of O. We also prove several topological properties of the bifurcation set $\mathscr {E}_\beta $. The key to extending the results from $\beta \in (1,2]$ to all $\beta>1$ is an appropriate generalization of the Farey words that are used to parameterize the connected components of the set O. Some of the original proofs from the above-mentioned papers are simplified.

In this paper, we introduce a new technique to study the distribution in residue classes of sets of integers with digit and sum-of-digits restrictions. From our main theorem, we derive a necessary and sufficient condition for integers with missing digits to be uniformly distributed in arithmetic progressions, extending previous results going back to the work of Erdős, Mauduit and Sárközy. Our approach uses Markov chains and does not rely on Fourier analysis as many results of this nature do. Our results apply more generally to the class of multiplicatively invariant sets of integers. This class, defined by Glasscock, Moreira and Richter using symbolic dynamics, is an integer analogue to fractal sets and includes all missing digits sets. We address uniform distribution in this setting, partially answering an open question posed by the same authors.

Recently, Barros et al. [‘On the shortest distance between orbits and the longest common substring problem’, Adv. Math. 344 (2019), 311–339] adopted a dynamical system perspective to study the decay of the shortest distance between orbits. We calculate the Hausdorff dimensions of the exceptional sets arising from the shortest distance between orbits in conformal iterated function systems.

We show that the dynamical system associated by Putnam to a pair of graph embeddings is identical to the shift map on the limit space of a self-similar groupoid action on a graph. Moreover, performing a certain out-split on said graph gives rise to a Katsura–Exel–Pardo groupoid action on the out-split graph whose associated limit space dynamical system is conjugate to the previous one. We characterise the self-similar properties of these groupoids in terms of properties of their defining data, two matrices A, B. We prove a large class of the associated limit spaces are bundles of circles and points that fibre over a totally disconnected space, and the dynamics restricted to each circle are of the form $z\to z^{n}$. Moreover, we find a planar embedding of these spaces, thereby answering a question Putnam posed in his paper.

We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only modify the tape at a bounded distance around the head, change the state, and move the head in a bounded way. We study three natural subgroups arising in this model: the group of finite-state automata, which generalizes the topological full groups studied in topological dynamics and the theory of orbit-equivalence; the group of oblivious Turing machines whose movement is independent of tape contents, which generalizes lamplighter groups and has connections to the study of universal reversible logical gates, and the group of elementary Turing machines, which are the machines which are obtained by composing finite-state automata and oblivious Turing machines.

We show that both the group of oblivious Turing machines and that of elementary Turing machines are finitely generated, while the group of finite-state automata and the group of reversible Turing machines are not. We show that the group of elementary Turing machines has undecidable torsion problem. From this, we also obtain that the group of cellular automata (more generally, the automorphism group of any uncountable one-dimensional sofic subshift) contains a finitely generated subgroup with undecidable torsion problem. We also show that the torsion problem is undecidable for the topological full group of a full $\mathbb {Z}^d$-shift on a nontrivial alphabet if and only if $d \geq 2$.

We define a family of discontinuous maps on the circle, called Bowen–Series-like maps, for geometric presentations of surface groups. The family has $2N$ parameters, where $2N$ is the number of generators of the presentation. We prove that all maps in the family have the same topological entropy, which coincides with the volume entropy of the group presentation. This approach allows a simple algorithmic computation of the volume entropy from the presentation only, using the Milnor–Thurston theory for one-dimensional maps.

For full shifts on finite alphabets, Coelho and Quas [Criteria for $\overline {d}$-continuity. Trans. Amer. Math. Soc. 350(8) (1998), 3257–3268] showed that the map that sends a Hölder continuous potential $\phi $ to its equilibrium state $\mu _\phi $ is $\overline {d}$-continuous. We extend this result to the setting of full shifts on countable (infinite) alphabets. As part of the proof, we show that the map that sends a strongly positive recurrent potential to its normalization is continuous for potentials on mixing countable state Markov shifts.

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of continuous functions on the shift space contains two disjoint subsets: one is a dense $G_\delta $ set for which all maximizing measures have ‘relatively small’ entropy; the other is the set of functions having uncountably many, fully supported ergodic maximizing measures with ‘relatively large’ entropy. This result generalizes and unifies the results of Morris [Discrete Contin. Dyn. Syst. 27 (2010), 383–388] and Shinoda [Nonlinearity 31 (2018), 2192–2200] on symbolic dynamics, and applies to a wide class of intrinsically ergodic non-Markov symbolic dynamics without the Bowen specification property, including any transitive piecewise monotonic interval map, some coded shifts, and multidimensional $\beta $-transformations. Along with these examples of application, we provide an example of an intrinsically ergodic subshift with positive obstruction entropy to specification.

R. Pavlov and S. Schmieding [On the structure of generic subshifts. Nonlinearity 36 (2023), 4904–4953] recently provided some results about generic $\mathbb {Z}$-shifts, which rely mainly on an original theorem stating that isolated points form a residual set in the space of $\mathbb {Z}$-shifts such that all other residual sets must contain it. As a direction for further research, they pointed towards genericity in the space of $\mathbb {G}$-shifts, where $\mathbb {G}$ is a finitely generated group. In the present text, we approach this for the case of $\mathbb {Z}^d$-shifts, where $d \ge 2$. As it is usual, multidimensional dynamical systems are much more difficult to understand. In light of the result of R. Pavlov and S. Schmieding, it is natural to begin with a better understanding of isolated points. We prove here a characterization of such points in the space of $\mathbb {Z}^d$-shifts, in terms of the natural notion of maximal subsystems that we also introduce in this article. From this characterization, we recover the result of R. Pavlov and S. Schmieding for $\mathbb {Z}^1$-shifts. We also prove a series of results that exploit this notion. In particular, some transitivity-like properties can be related to the number of maximal subsystems. Furthermore, we show that the Cantor–Bendixon rank of the space of $\mathbb {Z}^d$-shifts is infinite for $d>1$, while for $d=1$, it is known to be equal to one.

We study the descriptive complexity of sets of points defined by restricting the statistical behaviour of their orbits in dynamical systems on Polish spaces. Particular examples of such sets are the sets of generic points of invariant Borel probability measures, but we also consider much more general sets (for example, $\alpha $-Birkhoff regular sets and the irregular set appearing in the multifractal analysis of ergodic averages of a continuous real-valued function). We show that many of these sets are Borel in general, and all these are Borel when we assume that our space is compact. We provide examples of these sets being non-Borel, properly placed at the first level of the projective hierarchy (they are complete analytic or co-analytic). This proves that the compactness assumption is, in some cases, necessary to obtain Borelness. When these sets are Borel, we measure their descriptive complexity using the Borel hierarchy. We show that the sets of interest are located at most at the third level of the hierarchy. We also use a modified version of the specification property to show that these sets are properly located at the third level of the hierarchy for many dynamical systems. To demonstrate that the specification property is a sufficient, but not necessary, condition for maximal descriptive complexity of a set of generic points, we provide an example of a compact minimal system with an invariant measure whose set of generic points is $\boldsymbol {\Pi }^0_3$-complete.