اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the topological entropy of subshifts of finite type on free semigroups
171
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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.
قيم البحث
اقرأ أيضاً
This paper deals with the topological entropy for hom Markov shifts $mathcal{T}_M$ on $d$-tree. If $M$ is a reducible adjacency matrix with $q$ irreducible components $M_1, cdots, M_q$, we show that $h(mathcal{T}_{M})=max_{1leq ileq q}h(mathcal{T}_{M
_{i}})$ fails generally, and present a case study with full characterization in terms of the equality. Though that it is likely the sets ${h(mathcal{T}_{M}):Mtext{ is binary and irreducible}}$ and ${h(mathcal{T}_{X}):Xtext{ is a one-sided shift}}$ are not coincident, we show the two sets share the common closure. Despite the fact that such closure is proved to contain the interval $[d log 2, infty)$, numerical experiments suggest its complement contain open intervals.
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.
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 o
f 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.
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 study the topological entropy of hom tree-shifts and show that, although the topological entropy is not conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In doi:10.1016/j.tcs.2018.05.034 and doi
:10.3934/dcds.2020186, Petersen and Salama demonstrated the existence of topological entropy for tree-shifts and $h(mathcal{T}_X) geq h(X)$, where $mathcal{T}_X$ is the hom tree-shift derived from $X$. We characterize a necessary and sufficient condition when the equality holds for the case where $X$ is a shift of finite type. In addition, two novel phenomena have been revealed for tree-shifts. There is a gap in the set of topological entropy of hom tree-shifts of finite type, which makes such a set not dense. Last but not least, the topological entropy of a reducible hom tree-shift of finite type is equal to or larger than that of its maximal irreducible component.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
