Enumerating 2D percolation series by the finite-lattice method: theory
From MaRDI portal
Publication:4889240
DOI10.1088/0305-4470/28/2/011zbMath0849.05003OpenAlexW2075741188WikidataQ56112475 ScholiaQ56112475MaRDI QIDQ4889240
Publication date: 3 November 1996
Published in: Journal of Physics A: Mathematical and General (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0305-4470/28/2/011
percolationsquare latticeanimalsenumeration of series of interestpercolation seriesperimeter polynomialstransfer-matrix algorithm
Exact enumeration problems, generating functions (05A15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Percolation (82B43)
Related Items (13)
λ > 4 ⋮ Unnamed Item ⋮ A decomposition of column-convex polyominoes and two vertex statistics ⋮ Smooth column convex polyominoes ⋮ Loops and regions in Hitomezashi patterns ⋮ The design of efficient dynamic programming and transfer matrix enumeration algorithms ⋮ On the complexity of Jensen's algorithm for counting fixed polyominoes ⋮ Code for polyomino and computer search of isospectral polyominoes ⋮ Rooted spiral trees on hyper-cubic lattices ⋮ On column-convex and convex Carlitz polyominoes ⋮ Exact Enumerations ⋮ Improved upper bounds on the growth constants of polyominoes and polycubes ⋮ Synergistic development of differential approximants and the finite lattice method in lattice statistics
This page was built for publication: Enumerating 2D percolation series by the finite-lattice method: theory
