Enumerating 2D percolation series by the finite-lattice method: theory
- 1 January 1995
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 28 (2) , 335-349
- https://doi.org/10.1088/0305-4470/28/2/011
Abstract
This paper describes a transfer-matrix algorithm for enumeration of series of interest in percolation on the square lattice. It allows efficient generation of both low-temperature and high-temperature expansions, as well as the combinatorially interesting enumeration of undirected animals by area or perimeter, with moments of the other property.Keywords
This publication has 15 references indexed in Scilit:
- Lattice animals: A fast enumeration algorithm and new perimeter polynomialsJournal of Statistical Physics, 1990
- Derivation of series expansions for a study of percolation processesJournal of Physics A: General Physics, 1986
- Generating functions for connected embeddings in a lattice. IV. Site percolationJournal of Physics A: General Physics, 1986
- On the number of lattice animals embeddable in the square latticeJournal of Physics A: General Physics, 1982
- Counting polyominoes: Yet another attackDiscrete Mathematics, 1981
- Percolation processes in three dimensionsJournal of Physics A: General Physics, 1976
- Percolation processes in two dimensions IV. Percolation probabilityJournal of Physics A: General Physics, 1976
- Percolation processes in two dimensions. III. High density series expansionsJournal of Physics A: General Physics, 1976
- Percolation processes in two dimensions. II. Critical concentrations and the mean size indexJournal of Physics A: General Physics, 1976
- Percolation processes in two dimensions. I. Low-density series expansionsJournal of Physics A: General Physics, 1976