Cell Growth Problems
From MaRDI portal
Publication:5564335
DOI10.4153/CJM-1967-080-4zbMath0178.00904OpenAlexW2312413878MaRDI QIDQ5564335
Publication date: 1967
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1967-080-4
Related Items
Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models., Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, λ > 4, Algebraic languages and polyominoes enumeration, An improved upper bound on the growth constant of polyominoes, On the upper critical dimension of lattice trees and lattice animals, Self-avoiding walks and trees in spread-out lattices, High-dimensional holeyominoes, Recovering highly-complex linear recurrences of integer sequences, COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES, Enumeration of various animals on the triangular lattice, Unnamed Item, Enumerating polyominoes with fixed perimeter defect, Haruspicy and anisotropic generating functions, The number of polyiamonds is supermultiplicative, Tiling with Monotone Polyominos, Enumeration of planar Tangles, Counting Polycubes without the Dimensionality Curse, Detection of an anomalous cluster in a network, Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3, Location of the adsorption transition for lattice polymers, Counting polyominoes: yet another attack, Algorithms for counting minimum-perimeter lattice animals, Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees, Extremal geometry of a Brownian porous medium, On the complexity of Jensen's algorithm for counting fixed polyominoes, Concatenation arguments and their applications to polyominoes and polycubes, A Dynamical System Approach to Polyominoes Generation*, Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals, On the number of entangled clusters, Planar tilings by polyominoes, polyhexes, and polyiamonds, Unnamed Item, Unnamed Item, On the cell-growth problem for arbitrary polygons, Asymptotic bounds for the number of convex \(n\)-ominoes, Formulae and growth rates of high-dimensional polycubes, Unnamed Item, The growth rate of high-dimensional tree polycubes, Unnamed Item, On general dissections of a polygon, A Partition Theory of Planar Animals, A strong law for the longest edge of the minimal spanning tree, Generating functions for column-convex polyominoes, Representing Permutations with Few Moves, History and Introduction to Polygon Models and Polyominoes, Exactly Solved Models, Crumpling self-avoiding surfaces, 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, Matchings in pentagonal chains, Image denoising by statistical area thresholding, Polycubes with small perimeter defect, Adsorption of lattice polymers with quenched topologies, A pattern theorem for lattice clusters, A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons., Improved upper bounds on the growth constants of polyominoes and polycubes, On a reconstruction problem of Harary and Manvel, An improved lower bound on the growth constant of polyiamonds, Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
