演講時間：114年4月8日下午1點30分

演講地點：A813

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

摘要:

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.

演講海報與活動照片: