Please use this identifier to cite or link to this item:

Title: On structure of topological entropy for tree-shifts of finite type
Authors: 班榮超
Ban, Jung-Chao 
Contributors: 應數系
Keywords: Tree-SFT;Topological entropy
Date: 2021-08
Issue Date: 2021-10-27 11:00:06 (UTC+8)
Abstract: This paper deals with the topological entropy for hom Markov shifts TM on d-tree. If M is a reducible adjacency matrix with q irreducible components M1,⋯,Mq, we show that h(TM)=max1≤i≤q⁡h(TMi) fails generally, and present a case study with full characterization in terms of the equality. Though that it is likely the sets {h(TM):M is binary and irreducible} and {h(TX):X 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 [dlog⁡2,∞), numerical experiments suggest its complement contain open intervals.
Relation: Journal of Differential Equations, 292, 325-353
Data Type: article
DOI 連結:
Appears in Collections:[應用數學系] 期刊論文

Files in This Item:

File Description SizeFormat
19.pdf675KbAdobe PDF38View/Open

All items in 學術集成 are protected by copyright, with all rights reserved.

社群 sharing