The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper, we study subshifts of finite symbolic rank as essentially minimal Cantor systems. We show that minimal subshifts of finite symbolic rank have finite topological rank, and conversely, every minimal Cantor system of finite topological rank is either an odometer or conjugate to a minimal subshift of finite symbolic rank. We characterize the class of all minimal Cantor systems conjugate to a rank-$1$ subshift and show that it is dense but not generic in the Polish space of all minimal Cantor systems. Within some different Polish coding spaces of subshifts, we also show that the rank-1 subshifts are dense but not generic. Finally, we study topological factors of minimal subshifts of finite symbolic rank. We show that every infinite odometer and every irrational rotation is the maximal equicontinuous factor of a minimal subshift of symbolic rank $2$, and that a subshift factor of a minimal subshift of finite symbolic rank has finite symbolic rank.

We present a streamlined proof of a result essentially presented by the author in [Some counterexamples in topological dynamics. Ergod. Th. & Dynam. Sys. 28(4) (2008), 1291–1322], namely that for every set $S = \{s_1, s_2, \ldots \} \subset \mathbb {N}$ of zero Banach density and finite set A, there exists a minimal zero-entropy subshift $(X, \sigma )$ so that for every sequence $u \in A^{\mathbb {Z}}$, there is $x_u \in X$ with $x_u(s_n) = u(n)$ for all $n \in \mathbb {N}$. Informally, minimal deterministic sequences can achieve completely arbitrary behavior upon restriction to a set of zero Banach density. As a corollary, this provides counterexamples to the polynomial Sarnak conjecture reported by Eisner [A polynomial version of Sarnak’s conjecture. C. R. Math. Acad. Sci. Paris 353(7) (2015), 569–572] which are significantly more general than some recently provided by Kanigowski, Lemańczyk and Radziwiłł [Prime number theorem for analytic skew products. Ann. of Math. (2) 199 (2024), 591–705] and by Lian and Shi [A counter-example for polynomial version of Sarnak’s conjecture. Adv. Math. 384 (2021), Paper no. 107765] and shows that no similar result can hold under only the assumptions of minimality and zero entropy.

Pavlov [Adv. Math. 295 (2016), 250–270; Nonlinearity 32 (2019), 2441–2466] studied the measures of maximal entropy for dynamical systems with weak versions of specification property and found the existence of intrinsic ergodicity would be influenced by the assumptions of the gap functions. Inspired by these, in this article, we study the dynamical systems with non-uniform specification property. We give some basic properties these systems have and give an assumption for the gap functions to ensure the systems have the following five properties: CO-measures are dense in invariant measures; for every non-empty compact connected subset of invariant measures, its saturated set is dense in the total space; ergodic measures are residual in invariant measures; ergodic measures are connected; and entropy-dense. In addition, we will give examples to show the assumption is optimal.

We characterize the stabilized automorphism group for odometers and Toeplitz subshifts, and then prove an invariance property of the stabilized automorphism group of these dynamical systems. Namely, we prove the isomorphism invariance of the primes for which the p-adic valuation of the period structure tends to infinity. A particular case of interest is that for torsion-free odometers, the stabilized automorphism group is a full isomorphism invariant.

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, respectively a sofic subshift, if and only if so is X. Similarly, let G be a countable monoid and let A, B be Artinian modules over a ring. We prove that for every closed subshift submodule $\Sigma \subset A^G$ and every injective G-equivariant uniformly continuous module homomorphism $\tau \colon \! \Sigma \to B^G$, a subshift $\Delta \subset \Sigma $ is of finite type, respectively sofic, if and only if so is the image $\tau (\Delta )$. Generalizations for admissible group cellular automata over admissible Artinian group structure alphabets are also obtained.

This paper is a continuation of the paper, Matsumoto [‘Subshifts, $\lambda $ -graph bisystems and $C^*$ -algebras’, J. Math. Anal. Appl. 485 (2020), 123843]. A $\lambda $ -graph bisystem consists of a pair of two labeled Bratteli diagrams satisfying a certain compatibility condition on their edge labeling. For any two-sided subshift $\Lambda $ , there exists a $\lambda $ -graph bisystem satisfying a special property called the follower–predecessor compatibility condition. We construct an AF-algebra ${\mathcal {F}}_{\mathcal {L}}$ with shift automorphism $\rho _{\mathcal {L}}$ from a $\lambda $ -graph bisystem $({\mathcal {L}}^-,{\mathcal {L}}^+)$ , and define a $C^*$ -algebra ${\mathcal R}_{\mathcal {L}}$ by the crossed product . It is a two-sided subshift analogue of asymptotic Ruelle algebras constructed from Smale spaces. If $\lambda $ -graph bisystems come from two-sided subshifts, these $C^*$ -algebras are proved to be invariant under topological conjugacy of the underlying subshifts. We present a simplicity condition of the $C^*$ -algebra ${\mathcal R}_{\mathcal {L}}$ and the K-theory formulas of the $C^*$ -algebras ${\mathcal {F}}_{\mathcal {L}}$ and ${\mathcal R}_{\mathcal {L}}$ . The K-group for the AF-algebra ${\mathcal {F}}_{\mathcal {L}}$ is regarded as a two-sided extension of the dimension group of subshifts.

Furstenberg [Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation. Math. Syst. Theory1 (1967), 1–49] calculated the Hausdorff and Minkowski dimensions of one-sided subshifts in terms of topological entropy. We generalize this to $\mathbb{Z}^{2}$-subshifts. Our generalization involves mean dimension theory. We calculate the metric mean dimension and the mean Hausdorff dimension of $\mathbb{Z}^{2}$-subshifts with respect to a subaction of $\mathbb{Z}$. The resulting formula is quite analogous to Furstenberg’s theorem. We also calculate the rate distortion dimension of $\mathbb{Z}^{2}$-subshifts in terms of Kolmogorov–Sinai entropy.

Suppose $(X,\unicode[STIX]{x1D70E})$ is a subshift, $P_{X}(n)$ is the word complexity function of $X$, and $\text{Aut}(X)$ is the group of automorphisms of $X$. We show that if $P_{X}(n)=o(n^{2}/\log ^{2}n)$, then $\text{Aut}(X)$ is amenable (as a countable, discrete group). We further show that if $P_{X}(n)=o(n^{2})$, then $\text{Aut}(X)$ can never contain a non-abelian free monoid (and, in particular, can never contain a non-abelian free subgroup). This is in contrast to recent examples, due to Salo and Schraudner, of subshifts with quadratic complexity that do contain such a monoid.

Higher-rank graphs were introduced by Kumjian and Pask to provide models for higher-rank Cuntz–Krieger algebras. In a previous paper, we constructed 2-graphs whose path spaces are rank-two subshifts of finite type, and showed that this construction yields aperiodic 2-graphs whoseC*-algebras are simple and are not ordinary graph algebras. Here we show that the construction also gives a family of periodic 2-graphs which we call domino graphs. We investigate the combinatorial structure of domino graphs, finding interesting points of contact with the existing combinatorial literature, and prove a structure theorem for the C*-algebras of domino graphs.