We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient function is assumed}, then the two theorems hold.
In this paper, we analyze the Borel complexity of the topological conjugacy relation on Toeplitz subshifts. More specifically, we prove that topological conjugacy of Toeplitz subshifts with separated holes is hyperfinite. Indeed, we show that the topological conjugacy relation is hyperfinite on a larger class of Toeplitz subshifts which we call Toeplitz subshifts with growing blocks. This result provides a partial answer to a question asked by Sabok and Tsankov.
We show that for every metrizable Choquet simplex $K$ and for every group $G$, which is infinite, countable, amenable and residually finite, there exists a Toeplitz $G$-subshift whose set of shift-invariant probability measures is affine homeomorphic to $K$. Furthermore, we get that for every integer $d\geq 1$ and every Toeplitz flow $(X,T)$, there exists a Toeplitz ${\mathbb Z}^d$-subshift which is topologically orbit equivalent to $(X,T)$.
We compute an explicit representation of the (topological) automorphism group or a particular Toeplitz subshift. The automorphism group is a (non-finitely generated) subgroup of rational numbers under addition and the shift map corresponds to the rational number 1. The group is the additive subgroup of the rational numbers generated by the powers of 5/2.
In this paper, we study the descriptive set theoretic complexity of the equivalence relation of conjugacy of Toeplitz subshifts of a residually finite group $G$. On the one hand, we show that if $G = \mathbb{Z}$, then topological conjugacy on Toeplitz subshifts with separated holes is amenable. In contrast, if $G$ is non-amenable, then conjugacy of Toeplitz $G$-subshifts is a non-amenable equivalence relation. The results were motivated by a general question, asked by Gao, Jackson and Seward, about the complexity of conjugacy for minimal, free subshifts of countable groups.
In this article we study automorphisms of Toeplitz subshifts. Such groups are abelian and any finitely generated torsion subgroup is finite and cyclic. When the complexity is non superlinear, we prove that the automorphism group is, modulo a finite cyclic group, generated by a unique root of the shift. In the subquadratic complexity case, we show that the automorphism group modulo the torsion is generated by the roots of the shift map and that the result of the non superlinear case is optimal. Namely, for any $\varepsilon > 0$ we construct examples of minimal Toeplitz subshifts with complexity…
Given a dynamical system $(X,G)$, the centralizer $C(G)$ denotes the group of all homeomorphisms of $X$ which commute with the action of $G$. This group is sometimes called the automorphism group of the dynamical system $(X,G)$. In this note, we generalize the construction of Bulatek and Kwiatkowski (1992) to $\mathbb Z^d$-Toepltiz systems by identifying a class of $\mathbb Z^d$-Toeplitz systems that have trivial centralizers. We show that this class of $\mathbb Z^d$-Toeplitz with trivial centralizers contains systems with positive topological entropy.
We investigate combinatorial properties of aperiodic simple Toeplitz subshifts, as well as spectral properties of Jacobi operators defined by them. More precisely, we derive explicit formulas for complexity, palindrome complexity and, for sufficiently large word length, repetitivity. In addition we give a complete description of the de Bruijn graphs. We characterise alpha-repetitivity and, based on a work by Liu and Qu from 2011, the Boshernitzan condition. These combinatorial results can also be found in [arXiv:1801.08778]. Regarding the Jacobi operators, we show that they have empty pure poi…
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the repetitivity function are proven. Moreover, a complete description of the de Bruijn graphs of the subshifts is given. Finally, the Boshernitzan condition is characterised in terms of combinatorial quantities, based on a recent result of Liu and Qu. Particular simple characterisations are provided for simple Toeplitz subshifts that correspond to the orbital Schrei…
We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand we provide an example of a $\mathcal{B}$-free Toeplitz subshift whose automorphism group has elements of arbitrarily large finite order, answering Question 11 in [13].
We prove that any divisible dynamical simplex is the set of invariant measures of some Toeplitz subshift. We apply our construction to prove that orbit equivalence of Toeplitz subshifts is Borel bireducible to the universal equivalence relation induced by a Borel action of a nonarchimedean Polish group.
We investigate generic properties (i.e. properties corresponding to residual sets) in the space of subshifts with the Hausdorff metric. Our results deal with four spaces: the space $\mathbf{S}$ of all subshifts, the space $\mathbf{S}^{\prime}$ of non-isolated subshifts, the closure $\overline{\mathbf{T}^{\prime}}$ of the infinite transitive subshifts, and the closure $\overline{\mathbf{T}\mathbf{T}^{\prime}}$ of the infinite totally transitive subshifts. In the first two settings, we prove that generic subshifts are fairly degenerate; for instance, all points in a generic subshift are biasympt…
For each $\mathscr{B}$-free subshift given by $\mathscr{B}=\{2^ib_i\}_{i\in\mathbb{N}}$, where $\{b_i\}_{i\in\mathbb{N}}$ is a set of pairwise coprime odd numbers greater than one, it is shown that its automorphism group consists solely of powers of the shift.
We present a new sufficient criterion to prove that a non-sofic half-synchronized subshift is direct prime. The criterion is based on conjugacy invariant properties of Fischer graphs of half-synchronized shifts. We use this criterion to show as a new result that all n-Dyck shifts are direct prime, and we also give new proofs of direct primeness of non-sofic beta-shifts and non-sofic S-gap shifts. We also construct a class of non-sofic synchronized direct prime subshifts which additionally admit reversible cellular automata with all directions sensitive.
The Jacobs--Keane theorem from the $\cS$-adic viewpoint
Université de Picardie Jules Verne（皮卡第儒勒·凡尔纳大学）；Laboratoire Amiénois de Mathématique Fondamentale et Apliquée, CNRS-UMR 7352（亚眠基础与应用数学实验室，法国国家科学研究中心联合研究单位7352）
In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being treated by means of the former. We prove fairly complete asymptotic counting results for multipliers and diameters associated with preimages or periodic orbits ordered hy a natural geometric weighting. We also prove the corresponding Central Limit Theorems describing the further features of the distribution of their weights. These have direct applications to a…
