學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Entropy Dimension of Shift Spaces on Monoids
作者 班榮超
Ban, Jung-Chao
Chang, Chih-Hung
Huang, Nai-Zhu
貢獻者 應數系
日期 2020-06
上傳時間 25-Jan-2021 14:24:49 (UTC+8)
摘要 We consider the entropy dimension of G-shifts of finite type for the case where G is a non-Abelian monoid. Entropy dimension tells us whether a shift space has zero topological entropy. Suppose the Cayley graph CG of G has a finite representation (that is, {CgG : g ∈ G} is a finite set up to graph isomorphism), and relations among generators of G are determined by a matrix A. We reveal an association between the characteristic polynomial of A and the finite representation of the Cayley graph. After introducing an algorithm for the computation of the entropy dimension, the set of entropy dimensions is related to a collection of matrices in which the sum of each row of every matrix is bounded by the number of leaves of the graph. Furthermore, the algorithm extends to G having finitely many free-followers.
關聯 Journal of Mathematical Physics, 61, 072702
資料類型 article
DOI https://doi.org/10.1063/1.5124073
dc.contributor 應數系
dc.creator (作者) 班榮超
dc.creator (作者) Ban, Jung-Chao
dc.creator (作者) Chang, Chih-Hung
dc.creator (作者) Huang, Nai-Zhu
dc.date (日期) 2020-06
dc.date.accessioned 25-Jan-2021 14:24:49 (UTC+8)-
dc.date.available 25-Jan-2021 14:24:49 (UTC+8)-
dc.date.issued (上傳時間) 25-Jan-2021 14:24:49 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/133715-
dc.description.abstract (摘要) We consider the entropy dimension of G-shifts of finite type for the case where G is a non-Abelian monoid. Entropy dimension tells us whether a shift space has zero topological entropy. Suppose the Cayley graph CG of G has a finite representation (that is, {CgG : g ∈ G} is a finite set up to graph isomorphism), and relations among generators of G are determined by a matrix A. We reveal an association between the characteristic polynomial of A and the finite representation of the Cayley graph. After introducing an algorithm for the computation of the entropy dimension, the set of entropy dimensions is related to a collection of matrices in which the sum of each row of every matrix is bounded by the number of leaves of the graph. Furthermore, the algorithm extends to G having finitely many free-followers.
dc.format.extent 537070 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) Journal of Mathematical Physics, 61, 072702
dc.title (題名) Entropy Dimension of Shift Spaces on Monoids
dc.type (資料類型) article
dc.identifier.doi (DOI) 10.1063/1.5124073
dc.doi.uri (DOI) https://doi.org/10.1063/1.5124073