摘要
於2019 年，Petersen 和Salama [1, 2] 給出了在樹上拓樸熵的定義並證明其存在且等於最大下界，此外，證明在k-tree 上考慮黃金子平移，條型熵h_n^{(k)}會收斂到拓樸熵h^{(k)}。 此工作擴展了Petersen 和Salama 的結果，藉由考慮有限字母集A在黃 金分割樹T上利用條型法去計算其拓樸熵h(T_A)。首先，給出一個實數值矩 陣M^∗ 用來描述在高度為n條型樹上的複雜度。其次，找到兩個實數值矩 陣C, D 使得b_{n−2}D ≤ M^∗ ≤ b_{n−2}C, 其中b_{n−2}是指所有在黃金分割樹上的子平移高度為n − 2 的著色數。最後，證明在黃金分割樹上的子平移，條型熵h_n(T_A) 將收斂到拓樸熵h(T_A)。
並列摘要
In 2019, Petersen and Salama [1, 2] showed that the limit in their definition of tree-shift topological entropy is actually the infimum and also proved that the site specific strip approximation entropies h_n^{(k)} converges to the entropy h^{(k)} of the golden-mean shift of finite type on the k-tree. In this article, we prove that the preceding work of Petersen and Salama can be extended to consider a golden-mean tree T with finite alphabet A and use the strip method to calculate its topological entropy h(T_A). First, a real matrix M which describe the complexity of strip method tree with hight n is introduced. Second, two real matrices C and D are constructed for which b_{n−2}D ≤ M^∗ ≤ b_{n−2}C, where b_{n−2} is the number of all different labeling of subtree of the golden-mean tree-shift with level n − 2. Finally, we shown that the n-strip entropy h_n(T_A) will converge to the topological entropy h(T_A) of golden-mean tree-shift T_A.
參考文獻
延伸閱讀
- 蔡孟翔（2010）。利用希爾伯特-黃轉換及多尺度熵於心電圖資料之探討〔碩士論文，國立臺北大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0023-1208201011014800
- 李明修（2011）。含有超分子結構之共軛樹枝狀高分子的合成與能量轉移之探討〔碩士論文，國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2011.00599
- Chen, K. T. (2020). 以分子動力模擬探討高熵合金之疊差能與力學性質 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU202003457
- 何侶航（2015）。Number-Theoretic Based Tree-Structured Integration Method〔碩士論文，國立中正大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0033-2110201614014280
- 黃立沅（2015）。Approximation Algorithms for Degree-Constrained Directed Steiner Tree Problem〔碩士論文，國立清華大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0016-0312201510303064