Counting lattice animals in high dimensions

@article{Luther2011CountingLA,
  title={Counting lattice animals in high dimensions},
  author={Sebastian Luther and Stephan Mertens},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  year={2011},
  volume={2011},
  pages={09026}
}
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 ≤ d ≤ 10. From the data we compute formulae for perimeter polynomials for lattice animals of size n ≤ 11 in arbitrary dimension d. When amended by combinatorial arguments… Expand

Figures and Tables from this paper

ournal of Statistical Mechanics : J Theory and Experiment Counting lattice animals in high dimensions
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 theExpand
Formulae and Growth Rates of Animals on Cubical and Triangular Lattices
A polyomino of size n consists of n squares joined along their edges. A popular example is the computer game Tetris, which features polyominoes of size 4. A d-dimensional polycube of size n is aExpand
Series Expansion of the Percolation Threshold on Hypercubic Lattices
We study proper lattice animals for bond- and site-percolation on the hypercubic lattice $\mathbb{Z}^d$ to derive asymptotic series of the percolation threshold $p_c$ in $1/d$, The first few terms ofExpand
Counting n-cell polycubes proper in n-k dimensions
TLDR
A theoretical framework for computing the explicit formula enumerating polycubes of size n that span n − k dimensions, for a fixed value of k is developed and a conjecture about the general form of the formula for a general k is proved. Expand
Yang-Lee edge singularities from extended activity expansions of the dimer density for bipartite lattices of dimensionality 2 ≤ d ≤ 7.
  • P. Butera, M. Pernici
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2012
TLDR
These results are consistent with, but more extensive and sometimes more accurate than, those obtained from the existing dimer series or from the estimates of related exponents for lattice animals, branched polymers, and fluids. Expand
Proper n-Cell Polycubes in n - 3 Dimensions
TLDR
A formula is proved for the number of polycubes of size n that are proper in (n - 3) dimensions, which is said to be proper in d dimensions if the convex hull of the centers of its cubes is d-dimensional. Expand
Automatic Proofs for Formulae Enumerating Proper Polycubes
TLDR
It is proved rigorously, for the first time, that the number of polycubes of size n that are proper in n − 4 dimensions is 2 n − 7 n n − 9. Expand
A generalized neighborhood for cellular automata
  • D. Zaitsev
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2017
Abstract A generalized neighborhood for d-dimensional cellular automata is introduced; it spans the range from von Neumann's to Moore's neighborhood using a parameter which represents the dimensionExpand
Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes
TLDR
This paper revisits and extends the approach presented by Klarner and Rivest in 1973 to bound A_2(n) and proves that $\lambda_d \leq (2d-2)e+o(1)$ for any value of $d \geq 2', using a novel construction of a rational generating function which dominates that of the sequence $\left(A_d(n)\right)$. Expand
The Perimeter of Proper Polycubes
We derive formulas for the number of polycubes of size $n$ and perimeter $t$ that are proper in $n-1$ and $n-2$ dimensions. These formulas complement computer based enumerations of perimeterExpand
...
1
2
3
...

References

SHOWING 1-10 OF 45 REFERENCES
Enumerations of Lattice Animals and Trees
We have developed an improved algorithm that allows us to enumerate the number of site animals on the square lattice up to size 46. We also calculate the number of lattice trees up to size 44 and theExpand
Simulations of lattice animals and trees
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubicExpand
Statistics of lattice animals
TLDR
In all dimensions the Parisi–Sourlas prediction is verified, and all exactly known critical exponents in dimensions 2, 3, 4, and 8 are verified, including the hitherto most precise estimates for growth constants in d 3. Expand
The critical dimension for lattice animals
Recent field theoretical calculations for lattice animals by Lubensky and Isaacson (see Phys. Rev. A, vol.20, p.2130, 1979) yield dc=8 as the critical dimension and provide a first order epsilonExpand
Exact Solution of a Directed-Site Animals-Enumeration Problem in three Dimensions.
An exact equivalence is established between the directed-site animals-enumeration (DSAE) problem in $d$ dimensions and a crystal-growth model defined on the same lattice. In special cases, the latterExpand
Counting lattice animals: A parallel attack
A parallel algorithm for the enumeration of isolated connected clusters on a regular lattice is presented. The algorithm has been implemented on 17 RISC-based workstations to calculate the perimeterExpand
1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
We model a self-interacting branched polymer by a nearest-neighbour contact model of lattice animals with either site or bond counting (k- and k'-models, respectively). 1/d-expansions for the reducedExpand
Percolation processes in d-dimensions
Series data for the mean cluster size for site mixtures on a d-dimensional simple hypercubical lattice are presented. Numerical evidence for the existence of a critical dimension for the clusterExpand
Counting polycubes without the dimensionality curse
TLDR
An improved version of the polyomino-counting algorithm, whose order of memory consumption is a (very low) polynomial in both n and d, which is parallelized and ran through the Internet on dozens of computers simultaneously. Expand
Counting Polycubes without the Dimensionality Curse
TLDR
This paper presents a method whose order of memory consumption is a (very low) polynomial in both n and d, which enables us to find A d (n) for values of d and n far beyond any previous attempt. Expand
...
1
2
3
4
5
...