A pattern theorem for lattice clusters

DOI10.1007/BF01608793zbMath0935.60089arXivmath/9902161MaRDI QIDQ1306609

Neal Madras

Publication date: 20 December 1999

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9902161

zbMATH Keywords

percolationself-avoiding walkgrowth constantlattice animalpattern theorem

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43)

Related Items (30)

On the number of hexagonal polyominoes ⋮ λ > 4 ⋮ An improved upper bound on the growth constant of polyominoes ⋮ Recovering highly-complex linear recurrences of integer sequences ⋮ COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES ⋮ Enumerating polyominoes with fixed perimeter defect ⋮ The number of polyiamonds is supermultiplicative ⋮ Counting Polycubes without the Dimensionality Curse ⋮ Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 ⋮ Algorithms for counting minimum-perimeter lattice animals ⋮ Concatenation arguments and their applications to polyominoes and polycubes ⋮ KNOTTED 2-SPHERES IN TUBES IN Z⁴ ⋮ Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields ⋮ A Dynamical System Approach to Polyominoes Generation* ⋮ On the number of entangled clusters ⋮ Unnamed Item ⋮ Formulae and growth rates of high-dimensional polycubes ⋮ THE LINKING PROBABILITY FOR 2-COMPONENT LINKS WHICH SPAN A LATTICE TUBE ⋮ Unnamed Item ⋮ The growth rate of high-dimensional tree polycubes ⋮ Lattice Polygons and Related Objects ⋮ Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals ⋮ Counting polycubes without the dimensionality curse ⋮ Formulae and Growth Rates of High-Dimensional Polycubes ⋮ Automatic generation of formulae for polyominoes with a fixed perimeter defect ⋮ Polycubes with small perimeter defect ⋮ Adsorption of lattice polymers with quenched topologies ⋮ Improved upper bounds on the growth constants of polyominoes and polycubes ⋮ An improved lower bound on the growth constant of polyiamonds ⋮ Counting \(n\)-cell polycubes proper in \(n - k\) dimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number and size of branched polymers in high dimensions
• Submaps of maps. I: General 0-1 laws
• Entanglement complexity of lattice ribbons
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
• An Introduction to the Geometry of Numbers
• The free energy of a collapsing branched polymer
• Statistics of lattice animals
• Lattice Models of Polymers
• Metropolis Monte Carlo simulation of lattice animals
• Self-avoiding walks and polygons on non-Euclidean lattices
• Cell Growth Problems
• On the Number of Self-Avoiding Walks

This page was built for publication: A pattern theorem for lattice clusters