Patterns generation and spatial entropy in two-dimensional lattice models

檔案

本條目沒有附加檔案。

日期

2007-09-01

類型

期刊名稱

ASIAN JOURNAL OF MATHEMATICS

卷期與頁次

第 11 卷第 3 期,頁 497–534

ISSN

1093-6106

語言

英文

摘要

Patterns generation problems in two-dimensional lattice models are studied. Let S be the set of p symbols and Z(2lx2l), l >= 1, be a fixed finite square sublattice of Z(2). Function U : Z(2lx2l) -> S is called local pattern. Given a basic set B of local patterns, a unique transition matrix A(2) which is a q(2)xq(2) matrix, q = p(l2), can be defined. The recursive formulae of higher transition matrix A(n) on Z(2lxnl) have already been derived [4]. Now A(n)(m), m >= 1, contains all admissible patterns on Z((m+1)lxnl) which can be generated by B. In this paper, the connecting operator C-m, which comprises all admissible patterns on Z((m+1)lx2l), is carefully arranged. C-m can be used to extend A(n)(m) to A(n+1)(m) recursively for n >= 2. Furthermore, the lower bound of spatial entropy h(A(2)) can be derived through the diagonal part of C-m. This yields a powerful method for verifying the positivity of spatial entropy which is important in examining the complexity of the set of admissible global patterns. The trace operator T-m of C-m can also be introduced. In the case of symmetric A(2), T-2m gives a good estimate of the upper bound on spatial entropy. Combining C-m with T-m helps to understand the patterns generation problems more systematically.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Ban, J.-C., Lin, S.-S., & Lin, Y.-H. (2007). Patterns generation and spatial entropy in two-dimensional lattice models. ASIAN JOURNAL OF MATHEMATICS, 11(3), 497–534. https://ir.lib.nycu.edu.tw/handle/11536/10399

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/10399