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 $\left(d\ensuremath{-}1\right)$-dimensional restricted partitions of an integer. The directed compact lattice animal problem is solved exactly in $d\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}2,3$ using known solutions of the enumeration problem. The maximum number of lattice animals of size $n$ grows as $\mathrm{exp}({\mathrm{cn}}^{\left(d\ensuremath{-}1\right)/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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.