Directed Compact Lattice Animals, Restricted Partitions of an Integer, and the Infinite-State Potts Model

Authors:

Abstract
We consider a directed compact site lattice animal problem on the d-dimensional hypercubic lattice, and establish its equivalence with (i) the infinite-state Potts model and (ii) the enumeration of d−1-dimensional restricted partitions of an integer. The directed compact lattice animal problem is solved exactly in d=2,3 using known solutions of the enumeration problem. The maximum number of lattice animals of size n grows as exp(cnd−1/d). Also, the infinite-state Potts model solution leads to a conjectured limiting form for the generating function of restricted partitions for d>3, the latter an unsolved problem in number theory.

This publication has 10 references indexed in Scilit: