Combinatorics of interactions on plane lattices

Abstract

We consider the problem on enumerating the events appearing on the edges of regular plane lattices under given interactions at the nodes. We investigate a simple case where the interactions are described by a (0, l)-matrix of size 4x4. In particular, we study the asymptotic behaviour of the number of events as the linear sizes of the lattice tend to infinity and give estimates of the exponential growth of this number as functions of the matrix describing the interactions.