【115/4/9】16:20-17:10 黃迺筑 助理教授(高雄大學應用數學系)
發佈日期 :
2026-03-23
| Colloquium | |
|---|---|
|
|
|
| Time | 2026-4-9 16:20-17:10 |
| Venue | 數學館1樓31106教室 |
| Speaker | 黃迺筑 助理教授(高雄大學應用數學系) |
| Title | A Characterization of Positive Entropy of Markov Tree-Shifts |
| Abstract | Topological entropy is often considered as an indicator of complexity. However, there is no finitely checkable algorithm to determine the positive entropy of multidimensional shifts of finite type. Indeed, 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. |
|
|
|
