Journal of Statistical Mechanics Theory and Experiment · 2011 · 27 citations · 27 references
Natural SciencesComputer SciencePhysicsCombinatoricsComputational PhysicsScientific ComputingCombinatorial EnumerationCombinatorial Number TheoryComputational Number TheoryEnumerative CombinatoricsGenerating FunctionsProbabilistic CombinatoricsGrowth RatesLattice EnumerationLattice Point EnumerationPopulation Growth Rates
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 $d$-dimensional hypercubic lattices for $3 \leq d\leq 10$. From the data we compute formulas for perimeter polynomials for lattice animals of size $n\leq 11$ in arbitrary dimension $d$. When amended by combinatorial arguments, the new data suffices to yield explicit formulas for the number of lattice animals of size $n\leq 14$ and arbitrary $d$. 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.
27
<i>Introduction to Percolation Theory</i>
Dietrich Stauffer, Amnon Aharony, Sidney Redner · Physics Today · 1993 · 6.8K citations
David A. Klarner · Canadian Journal of Mathematics · 1967 · 193 citations · Full text