Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn automorphism groups of Toeplitz subshifts
143
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 bounded by $C n^{1+epsilon}$ whose automorphism groups are not finitely generated. Finally, we observe the coalescence and the automorphism group give no restriction on the complexity since we provide a family of coalescent Toeplitz subshifts with positive entropy such that their automorphism groups are arbitrary finitely generated infinite abelian groups with cyclic torsion subgroup (eventually restricted to powers of the shift).
rate research
Read More
It has been recently proved that the automorphism group of a minimal subshift with non-superlinear word complexity is virtually $mathbb{Z}$ [DDPM15, CK15]. In this article we extend this result to a broader class proving that the automorphism group of a minimal S-adic subshift of finite alphabet rank is virtually $mathbb{Z}$. The proof is based on a fine combinatorial analysis of the asymptotic classes in this type of subshifts, which we prove are a finite number.
Automorphism groups are intrincate conjugacy invariants for subshifts, which can reveal important features of the dynamical structure of a shift action. One important case is the study of automorphism groups when the underlying subshift has a very rigid structure, e.g. substitutive subshifts or aperiodic constructions with large-scale self-similarity, such as the Robinson shift. In this work we study the automorphism group of bijective substitutive subshifts, and a potential generalization in the form of the group of extended symmetries, studied previously by Michael Baake, John Roberts and Reem Yassawi (arXiv:1611.05756); these symmetries, by allowing for shearing and other deformations of the underlying group, may reveal additional information of a geometric nature about the structure of these subshifts.
Dimension groups are complete invariants of strong orbit equivalence for minimal Cantor systems. This paper studies a natural family of minimal Cantor systems having a finitely generated dimension group, namely the primitive unimodular proper S-adic subshifts. They are generated by iterating sequences of substitutions. Proper substitutions are such that the images of letters start with a same letter, and similarly end with a same letter. This family includes various classes of subshifts such as Brun subshifts or dendric subshifts, that in turn include Arnoux-Rauzy subshifts and natural coding of interval exchange transformations. We compute their dimension group and investigate the relation between the triviality of the infinitesimal subgroup and rational independence of letter measures. We also introduce the notion of balanced functions and provide a topological characterization of bal-ancedness for primitive unimodular proper S-adic subshifts.
We study topological groups $G$ for which the universal minimal $G$-system $M(G)$, or the universal irreducible affine $G$-system $IA(G)$ are tame. We call such groups intrinsically tame and convexly intrinsically tame. These notions are generaliz
In this paper, we provide an effective method to compute the topological entropies of $G$-subshifts of finite type ($G$-SFTs) with $G=F_{d}$ and $S_{d}$, the free group and free semigroup with $d$ generators respectively. We develop the entropy formula by analyzing the corresponding systems of nonlinear recursive equations (SNREs). Four types of SNREs of $S_{2}$-SFTs, namely the types $mathbf{E},mathbf{D},mathbf{C}$ and $mathbf{O}$, are introduced and we could compute their entropies explicitly. This enables us to give the complete characterization of $S_{2}$-SFTs on two symbols. That is, the set of entropies of $S_{2}$-SFTs on two symbols is equal to $mathbf{E}cup mathbf{D}cup mathbf{C}cup mathbf{O}$. The methods developed in $S_{d}$-SFTs will also be applied to the study of the entropy theory of $F_{d}$-SFTs. The entropy formulae of $S_{d}$-, $F_{d}$-golden mean shifts and $k$-colored chessboards are also presented herein.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
