ترغب بنشر مسار تعليمي؟ اضغط هنا

Computation of extended symmetry groups for multidimensional subshifts with hierarchical structure

109   0   0.0 ( 0 )
 نشر من قبل \\'Alvaro Bustos
 تاريخ النشر 2018
  مجال البحث
والبحث باللغة English
 تأليف Alvaro Bustos




اسأل ChatGPT حول البحث

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.



قيم البحث

اقرأ أيضاً

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 c yclic 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).
We prove that on B-free subshifts, with B satisfying the Erdos condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.
101 - Fabien Durand 2018
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding whether, give n p $in$ N, there exists such a constant subsequence along an arithmetic progression of common difference p. In the special case of uniformly recurrent automatic sequences we explicitely describe the sets of such p by means of automata.
237 - Valerie Berthe 2019
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.
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic, but the exis ting invariants are not sufficient for this purpose. We first show that given two minimal substitution subshifts, there exists a computable constant $R$ such that any factor map between these subshifts (if any) is the composition of a factor map with a radius smaller than $R$ and some power of the shift map. Then we prove that it is decidable to check whether a given sliding block code is a factor map between two prescribed minimal substitution subshifts. As a consequence of these two results, we provide an algorithm that, given two minimal substitution subshifts, decides whether one is a factor of the other and, as a straightforward corollary, whether they are isomorphic.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا