Please use this identifier to cite or link to this item: https://ah.lib.nccu.edu.tw/handle/140.119/137561
DC FieldValueLanguage
dc.contributor應數系
dc.creator班榮超
dc.creatorBan, Jung-Chao 
dc.creatorChih-HungChang
dc.creatorWen-GueiHu
dc.creatorYu-LiangWu
dc.date2021-08
dc.date.accessioned2021-10-27T03:00:06Z-
dc.date.available2021-10-27T03:00:06Z-
dc.date.issued2021-10-27T03:00:06Z-
dc.identifier.urihttp://nccur.lib.nccu.edu.tw/handle/140.119/137561-
dc.description.abstractThis 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.
dc.format.extent691234 bytes-
dc.format.mimetypeapplication/pdf-
dc.relationJournal of Differential Equations, 292, 325-353
dc.subjectTree-SFT ; Topological entropy
dc.titleOn structure of topological entropy for tree-shifts of finite type
dc.typearticle
dc.identifier.doi10.1016/j.jde.2021.05.016
dc.doi.urihttps://doi.org/10.1016/j.jde.2021.05.016
item.fulltextWith Fulltext-
item.grantfulltextrestricted-
item.openairetypearticle-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:期刊論文
Files in This Item:
File Description SizeFormat
19.pdf675.03 kBAdobe PDF2View/Open
Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.