Topological entropy for shifts of finite type over Z and trees

被引:1
|
作者
Ban, Jung-Chao [1 ,2 ]
Chang, Chih-Hung [3 ]
Hu, Wen-Guei [4 ]
Wu, Yu-Liang [5 ]
机构
[1] Natl Chengchi Univ, Dept Math Sci, Taipei 11605, Taiwan
[2] Natl Taiwan Univ, Natl Ctr Theoret Sci, Math Div, Taipei 10617, Taiwan
[3] Natl Univ Kaohsiung, Dept Appl Math, Kaohsiung 81148, Taiwan
[4] Sichuan Univ, Coll Math, Chengdu 610064, Peoples R China
[5] Natl Chiao Tung Univ, Dept Appl Math, Hsinchu 30010, Taiwan
基金
中国国家自然科学基金;
关键词
Tree-SFT; Topological entropy; UNDECIDABILITY;
D O I
10.1016/j.tcs.2022.07.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In [16,17], Petersen and Salama demonstrated the existence of topological entropy for tree-shifts and h(TX) >= h(X), where TX 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. Additionally, 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, making such a set not dense. Last but not least, the topological entropy of a reducible hom tree-shift of finite type can be strictly larger than that of its maximal irreducible component. (C) 2022 Elsevier B.V. All rights reserved.
引用
收藏
页码:24 / 32
页数:9
相关论文
共 50 条