Counting lattice animals: A parallel attack
type: Item
instance of: scholarly article
title: Counting lattice animals: A parallel attack
zbMATH Open document ID: 0925.82099
DOI: 10.1007/BF01060088
author: S. Mertens
author: Markus E. Lautenbacher
published in: Journal of Statistical Physics
publication date: 1993-10-27T00:00:00Z
review text: 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 perimeter polynomials for the plane triangular lattice up to clustersize \(s = 21\). New data for perimeter polynomials \(D_s\) up to \(D_2|_1\), total number of clusters \(g_s\) up to \(g_2|_2\), and coefficients \(b_r\) in the low-density series expansion of the mean cluster size up to \(b_2|_1\) are given.
Mathematics Subject Classification ID: 82B41
Mathematics Subject Classification ID: 82B80
zbMATH DE Number: 111923
MaRDI profile type: Publication
cites work: Q4544935
cites work: The impact of large-scale computing on lattice statistics.
cites work: Low-concentration series in general dimension.
description: scientific article; zbMATH DE number 111923