Patterns generation and spatial entropy in two-dimensional lattice models

摘要

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.