Colloquium / Seminars

Topic：The Characterization of Positive Entropy in Markov Tree-shifts
Speaker：Prof. Nai-Zhu Huang
　　　　(Department of Applied Mathematics, National University Kaoshiung)
Date time：May 13, 2025. 14:00 - 15:00
Venue：SA213
Abstract：
Abstract. Topological entropy is often regarded as an indicator of complexity. However, there is no finite algorithm to determine whether a d-dimensional (d>1) shift of finite type has positive entropy. In fact, this property is recursively enumerable. In this presentation, I will characterize positive entropy in Markov tree-shifts using adjacency matrices. Additionally, I will explore the relationships among positive entropy, topological properties, and chaotic behavior.
Download：Talk_0513.pdf

$返回$ go back