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

【演講時間】4月8日（星期二）下午1點30分

【演講地點】清華大學校本部第二綜合大樓B側8樓A813室

【摘要】

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.