A pattern theorem for lattice clusters

DOI10.1007/BF01608793zbMATH Open0935.60089arXivmath/9902161MaRDI QIDQ1306609FDOQ1306609

Neal Madras

Publication date: 20 December 1999

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

Abstract: We consider general classes of lattice clusters, including various kinds of animals and trees on different lattices. We prove that if a given local configuration ("pattern") of sites and bonds can occur in large clusters, then it occurs at least cN times in most clusters of size n, for some constant c>0. An analogous theorem for self-avoiding walks was proven in 1963 by Kesten. The results also apply to weighted sums, and in particular we can take a$subn$ to be the probability that the percolation cluster containing the origin consists of exactly n sites. Another consequence is strict inequality of connective constants for sublattices and for certain subclasses of clusters.

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)

Cites Work

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

Cited In (31)

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

   Recommendations

• New pattern theorems for square lattice self-avoiding walks and self-avoiding polygons 👍 👎
• Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields 👍 👎
• Statistics of lattice animals 👍 👎
• A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons. 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306609)