English

Counting Lattice Animals in High Dimensions

Statistical Mechanics 2011-10-11 v2 Combinatorics

Abstract

We present an implementation of Redelemeier's algorithm for the enumeration of lattice animals in high dimensional lattices. The implementation is lean and fast enough to allow us to extend the existing tables of animal counts, perimeter polynomials and series expansion coefficients in dd-dimensional hypercubic lattices for 3d103 \leq d\leq 10. From the data we compute formulas for perimeter polynomials for lattice animals of size n11n\leq 11 in arbitrary dimension dd. When amended by combinatorial arguments, the new data suffices to yield explicit formulas for the number of lattice animals of size n14n\leq 14 and arbitrary dd. We also use the enumeration data to compute numerical estimates for growth rates and exponents in high dimensions that agree very well with Monte Carlo simulations and recent predictions from field theory.

Cite

@article{arxiv.1106.1078,
  title  = {Counting Lattice Animals in High Dimensions},
  author = {Sebastian Luther and Stephan Mertens},
  journal= {arXiv preprint arXiv:1106.1078},
  year   = {2011}
}

Comments

18 pages, 7 figures, 6 tables; journal version

R2 v1 2026-06-21T18:18:21.310Z