演講公告

演講主題：The Characterization of Positive Entropy in Markov Tree-shifts
主講人：黃迺筑教授(高雄大學應數系)
演講日期：2025年5月13日(二) 14:00 –15:00
演講地點：(光復校區) 科學一館213室
摘要內容：
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.
相關檔案：Talk_0513.pdf

$返回$ go back