演講者：黃迺筑  博士

　　　　國立中央大學數學系

日　期：2024年02月20日（星期二）16:10

地　點：國立高雄大學理學院408室

講　題：The Characterization of Positive Entropy in Markov Tree-shifts

摘   要：

Topological entropy is often considered as an indicator of complexity. However, determining the positive entropy of multidimensional shifts of finite type lacks a finitely checkable algorithm, as it is right recursively enumerable. In this presentation, we will present the characterization of positive entropy in Markov tree-shifts by adjacency matrices. Additionally, we will reveal the relationship among positive entropy, topological properties, and chaotic behaviors.