|
||||
|
||||
|
Lattice Animals: A Fast Enumeration Algorithm and New Perimeter Polynomials
Abstract
A fast computer algorithm for enumerating isolated connected clusters on a
regular lattice and its Fortran implementation are presented. New perimeter
polynomials are calculated for the square, the triangular, the simple cubic,
and the square lattice with next nearest neighbors.
BiBTeX Entry
@article{, author = {Stephan Mertens}, title = {Lattice Animals: A Fast Enumeration Algorithm and New Perimeter Polynomials}, journal = {J.~Stat.~Phys.}, year = {1990}, volume = {58}, number = {5/6} pages = {1095-1108} }
Download:
© by Stephan Mertens (Datenschutzerklärung)
animals1.pdf
Home |
Research |
Publications |
Teaching |
Smorgasbord
updated on Thursday, April 17th 2008, 12:18:02 CET;