The following pages link to Cell Growth Problems (Q5564335):
Displayed 50 items.
- An improved upper bound on the growth constant of polyominoes (Q322215) (← links)
- Extremal geometry of a Brownian porous medium (Q466895) (← links)
- Formulae and growth rates of high-dimensional polycubes (Q555508) (← links)
- Matchings in pentagonal chains (Q791538) (← links)
- On the number of entangled clusters (Q967670) (← links)
- Counting polycubes without the dimensionality curse (Q1043990) (← links)
- Counting polyominoes: yet another attack (Q1155065) (← links)
- On the cell-growth problem for arbitrary polygons (Q1215640) (← links)
- On general dissections of a polygon (Q1253257) (← links)
- Crumpling self-avoiding surfaces (Q1285224) (← links)
- A pattern theorem for lattice clusters (Q1306609) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- Haruspicy and anisotropic generating functions (Q1398299) (← links)
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons. (Q1593196) (← links)
- Enumerating polyominoes with fixed perimeter defect (Q1689885) (← links)
- Planar tilings by polyominoes, polyhexes, and polyiamonds (Q1765444) (← links)
- A strong law for the longest edge of the minimal spanning tree (Q1807193) (← links)
- Generating functions for column-convex polyominoes (Q1813084) (← links)
- On a reconstruction problem of Harary and Manvel (Q1865368) (← links)
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models. (Q1872334) (← links)
- Self-avoiding walks and trees in spread-out lattices (Q1906397) (← links)
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3 (Q1945952) (← links)
- Automatic generation of formulae for polyominoes with a fixed perimeter defect (Q2088891) (← links)
- Polycubes with small perimeter defect (Q2093266) (← links)
- Adsorption of lattice polymers with quenched topologies (Q2096917) (← links)
- High-dimensional holeyominoes (Q2161201) (← links)
- Enumeration of planar Tangles (Q2197116) (← links)
- Concatenation arguments and their applications to polyominoes and polycubes (Q2230414) (← links)
- Asymptotic bounds for the number of convex \(n\)-ominoes (Q2264682) (← links)
- Counting \(n\)-cell polycubes proper in \(n - k\) dimensions (Q2357227) (← links)
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite (Q2368656) (← links)
- Recovering highly-complex linear recurrences of integer sequences (Q2398508) (← links)
- Detection of an anomalous cluster in a network (Q2429931) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals (Q2482280) (← links)
- The growth rate of high-dimensional tree polycubes (Q2509733) (← links)
- Image denoising by statistical area thresholding (Q2573029) (← links)
- On the upper critical dimension of lattice trees and lattice animals (Q2639456) (← links)
- Enumeration of various animals on the triangular lattice (Q2662791) (← links)
- Algorithms for counting minimum-perimeter lattice animals (Q2700382) (← links)
- Representing Permutations with Few Moves (Q2827490) (← links)
- Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals (Q2841489) (← links)
- Formulae and Growth Rates of High-Dimensional Polycubes (Q2851503) (← links)
- (Q2857314) (← links)
- Location of the adsorption transition for lattice polymers (Q2965753) (← links)
- λ > 4 (Q3452770) (← links)
- Counting Polycubes without the Dimensionality Curse (Q3511318) (← links)
- History and Introduction to Polygon Models and Polyominoes (Q3651678) (← links)
- Exactly Solved Models (Q3651680) (← links)
- A Partition Theory of Planar Animals (Q3887481) (← links)