To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
This work is motivated by the study of continued fraction expansions of real numbers: we describe in dynamical terms their orbits under the multiplicative action by $\mathbb {Z}$ and the projective action of $\operatorname {\mathrm {PGL}}_2(\mathbb {Z})$; hence, of $\operatorname {\mathrm {PGL}}_2(\mathbb {Q})$. A real number gives rise to a Sturmian system encoding a rotation of the circle, which is a particular case of an interval exchange system. It is well known that $\operatorname {\mathrm {PGL}}_2(\mathbb {Z})$-equivalence of real numbers, characterized by the tails of their continued fraction expansions, amounts to flow equivalence of Sturmian systems. We show that the multiplicative action of $m\in \mathbb {Z}$ on a real number corresponds to taking the mth-power followed by what we call an infinitesimal 2-asymptotic factor of its Sturmian system. This leads us to introduce the notion of isogeny between zero-dimensional systems: it combines flow equivalences, virtual conjugacies and infinitesimal asymptotic equivalences. We develop tools for classifying systems up to isogeny involving cohomological invariants and states. We then use this to give a complete description of $\operatorname {\mathrm {PGL}}_2(\mathbb {Q})$-equivalence of real numbers in terms of Sturmian systems. Considering powers of Sturmian systems leads naturally to the realm of Denjoy systems, and we classify Denjoy systems up to isogenies preserving this class via the action of $\operatorname {\mathrm {PGL}}_{2}(\mathbb {Q})$ on their invariants. We also investigate eventual flow equivalence and show that it implies topological conjugacy for Sturmian and Denjoy systems. For this, we prove the following novel arithmetic result that we believe is of independent interest. Consider $\alpha ,\beta \in \mathbb {R}\setminus \mathbb {Q}$; if for all but finitely many prime integers $n\in \mathbb {P}$ the numbers $n\alpha ,n\beta $ are $\operatorname {\mathrm {PGL}}_2(\mathbb {Z})$-equivalent, then $\alpha \equiv \pm \beta \bmod {\mathbb {Z}}$. In another direction, we consider interval exchanges satisfying Keane’s condition. We characterize flow equivalence in terms of interval-induced subsystems (or the tails of their paths in the bilateral Rauzy induction diagram). We describe their 2-AI factors in terms of minimal models. Finally, we find rational invariants for isogeny involving the length modules and SAF invariants of the associated ergodic measures. This leads to a conjecture for their classification up to isogeny, which we prove in the totally ergodic case.
A power-free language is characterized by the number of symbols used and a limit on how many times a block of symbols can repeat consecutively. For certain values of these parameters, it is known that the number of legal words grows exponentially fast with respect to length. In the terminology of dynamical systems and ergodic theory, this means that the corresponding shift space has positive topological entropy. We prove that in many cases, this shift space has a unique measure of maximal entropy. The proof uses a weak analog of Bowen’s specification property. The lack of any periodic points in power-free shift spaces stands in striking contrast to other applications of specification-based techniques, where the number of periodic points often has exponential growth rate given by the topological entropy.
We obtain a weighted equidistribution theorem for amenable skew product extensions of countable state Markov shifts satisfying the big images and pre-images (BIP) property. We also show, without requiring the BIP property, that Gurevič pressure for an amenable skew product agrees with the Gurevič pressure for the abelianized system. This had been proved by Dougall and Sharp in the case where the base is a subshift of finite type. The equality of Gurevič pressures is a key part of the proof of the equidistribution result.
To study any dynamical system, it is useful to find a partition that allows essentially faithful encoding (injective, up to a small exceptional set) into a subshift. Most topological and measure-theoretic systems can be represented by Bratteli–Vershik (or adic, or BV) systems. So, it is natural to ask when can a BV system be encoded essentially faithfully. Extending what was known previously for special diagrams and particular orders, we show here that for BV diagrams defined by homogeneous positive integer multivariable polynomials, and a wide family of their generalizations, which we call polynomial shape diagrams, for every choice of the edge ordering, the coding according to initial path segments of a fixed finite length is injective off of a negligible exceptional set.
It is known that for a uniform morphic sequence $\boldsymbol u = \langle u_n\rangle _{n=0}^\infty $ and an algebraic number $\beta $ such that $|\beta |>1$, the number $[\![ \boldsymbol {u} ]\!] _\beta :=\sum _{n=0}^\infty ({u_n}/{\beta ^n})$ either lies in $\mathbb Q(\beta )$ or is transcendental. In this paper, we show a similar rational–transcendental dichotomy for sequences defined by irreducible Pisot morphisms on binary alphabets. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases, we are able to show transcendence of $[\![ \boldsymbol {u}]\!] _{\beta }$ outright. In particular, for $k\geq 2$, if $\boldsymbol u$ is the k-Bonacci word, then $[\![ \boldsymbol {u}]\!] _{\beta }$ is transcendental.
The density of a rational language can be understood as the frequency of some pattern in the shift space, for example, a pattern like ‘words with an even number of a given letter’. We study the density of group languages, that is, rational languages recognized by morphisms onto finite groups, inside shift spaces. We show that the density with respect to any given ergodic measure on a shift space exists for every group language, because it can be computed by using any ergodic lift of the given measure to a skew product between the shift space and the recognizing group. We then further study densities in shifts of finite type (with a suitable notion of irreducibility) and then in minimal shifts. In the latter case, we obtain a closed formula for the density under the condition that the aforementioned skew product has minimal closed invariant subsets that are ergodic under the product of the original measure and the uniform probability measure on the group. The formula is derived in part from a characterization of minimal closed invariant subsets for skew products between shifts and finite groups relying on notions of cocycles and coboundaries. In the case where the whole skew product is ergodic under the product measure, then the density is just the cardinality of the subset of the group that defines the language divided by the cardinality of the group. Moreover, we provide sufficient conditions for the skew product to have minimal closed invariant subsets that are ergodic under the product measure. Finally, we investigate the link between minimal closed invariant subsets, return words, and bifix codes.
We show that the canonical anticommutation relations (CAR) algebra admits a Cantor spectrum $\mathrm {C}^\ast $-diagonal that is not conjugate to the standard AF diagonal. We obtain this by classification theory of $\mathrm {C}^\ast $-algebras, and the diagonal arises by realizing the CAR algebra as the crossed product of a free minimal action on the Cantor space, where the acting group is the product of a locally finite group with the infinite dihedral group. The main ingredient in the construction is a binary subshift associated to the well-known regular paper-folding sequence. Moreover, we show that the CAR algebra in fact admits countably many, pairwise non-conjugate, Cantor spectrum diagonals which are distinguished by the different values of their diagonal dimension, as defined by Li, Liao and the second named author.
We classify the sets of natural numbers n for which certain dynamical systems $(X,f)$ on a compact metric space X have a periodic point of (least) period n. Interest in this question dates back to Sharkovskii’s theorem for continuous maps on intervals of the real line, but it also ties to checkable conditions for Krieger’s embedding theorem for symbolic dynamical systems. Given a system for which the logarithmic derivative of the Artin–Mazur zeta function is rational, we use the Skolem–Mahler–Lech theorem to classify for which n the system has a periodic point of (not necessarily least) period n. Moreover, we build on work on finitely presented (FP) systems and their relationship to symbolic dynamics to classify the set of least periods, that is, periodic orbit lengths, for arbitrary FP systems, extending a known classification for shifts of finite type. We also provide several constructions to realize any such least period sets.
We develop a topological framework for Engel expansions that treats both directions of the correspondence between points of $(0,1]$ and nondecreasing digit sequences. We endow the sequence space with the product topology to study the evaluation map, and we fix a nonterminating digit algorithm to study the digit coding map. We also record the correspondence between cylinder sets and fundamental intervals and give an application to Baire category results for functions of the digits.
The action of a finite group G on a subshift of finite type (SFT) X is called free if every point has trivial stabilizer and it is called inert if the induced action on the dimension group of X is trivial. We show that any two free inert actions of a finite group G on an SFT are conjugate by an automorphism of any sufficiently high power of the shift space. This partially answers a question posed by Fiebig. As a consequence, we obtain that every two free elements of the stabilized automorphism group of a full shift are conjugate in this group. In addition, we generalize a result of Boyle, Carlsen, and Eilers concerning the flow equivalence of G-SFTs.
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}$.