Cell Growth Problems
From MaRDI portal
Publication:5564335
Recommendations
Cited in
(73)- Counting polycubes without the dimensionality curse
- Counting polyominoes: yet another attack
- On the cell-growth problem for arbitrary polygons
- On general dissections of a polygon
- Crumpling self-avoiding surfaces
- A pattern theorem for lattice clusters
- Algebraic languages and polyominoes enumeration
- Haruspicy and anisotropic generating functions
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
- Enumerating polyominoes with fixed perimeter defect
- Planar tilings by polyominoes, polyhexes, and polyiamonds
- A strong law for the longest edge of the minimal spanning tree
- Generating functions for column-convex polyominoes
- On a reconstruction problem of Harary and Manvel
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- Self-avoiding walks and trees in spread-out lattices
- Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3
- Automatic generation of formulae for polyominoes with a fixed perimeter defect
- Polycubes with small perimeter defect
- Adsorption of lattice polymers with quenched topologies
- High-dimensional holeyominoes
- Enumeration of planar Tangles
- Concatenation arguments and their applications to polyominoes and polycubes
- Asymptotic bounds for the number of convex \(n\)-ominoes
- Counting n-cell polycubes proper in n - k dimensions
- Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
- Recovering highly-complex linear recurrences of integer sequences
- Detection of an anomalous cluster in a network
- On the complexity of Jensen's algorithm for counting fixed polyominoes
- Decay of correlations in nearest-neighbor self-avoiding walk, percolation, lattice trees and animals
- The growth rate of high-dimensional tree polycubes
- Image denoising by statistical area thresholding
- On the upper critical dimension of lattice trees and lattice animals
- Enumeration of various animals on the triangular lattice
- Algorithms for counting minimum-perimeter lattice animals
- Representing permutations with few moves
- Expansion in high dimension for the growth constants of lattice trees and lattice animals
- Formulae and growth rates of high-dimensional polycubes
- The growth rate of high-dimensional tree polycubes
- Location of the adsorption transition for lattice polymers
- An improved upper bound on the growth constant of polyominoes
- \(\lambda > 4\)
- Counting Polycubes without the Dimensionality Curse
- History and introduction to polygon models and polyominoes
- Exactly solved models
- A Partition Theory of Planar Animals
- scientific article; zbMATH DE number 1340281 (Why is no real title available?)
- scientific article; zbMATH DE number 6897879 (Why is no real title available?)
- Extremal geometry of a Brownian porous medium
- Properties of minimal-perimeter polyominoes (multimedia exposition)
- Convex polyominoes revisited: enumeration of outer site perimeter, interior vertices, and boundary vertices of certain degrees
- A Dynamical System Approach to Polyominoes Generation*
- The estimation of the number of p2-tilings of a plane on a polyomino of given area
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- Formulae and growth rates of high-dimensional polycubes
- Improved upper bounds on the growth constants of polyominoes and polycubes
- An improved lower bound on the growth constant of polyiamonds
- The number of polyiamonds is supermultiplicative
- Tiling with Monotone Polyominos
- Smooth squared, triangular and hexagonal bargraphs
- An improved upper bound on the growth constant of polyiamonds
- On the exponential growth rates of lattice animals and interfaces
- Spread-out limit of the critical points for lattice trees and lattice animals in dimensions \(\boldsymbol{d}\boldsymbol> \textbf{8} \)
- Combinatorial exploration: an algorithmic framework for enumeration
- Rate of convergence of the critical point of the memory-\( \tau\) self-avoiding walk in dimensions \(d > 4\)
- Uniform sampling of fixed size polyominoes
- Bounding Klarner's constant from above using a simple recurrence
- Levels in baryiamonds
- Counting polyominoes, revisited
- Differentiability of the effective Lagrangian for Hamilton-Jacobi-Bellman equations in dynamic random environments
- Water capacity of baryiamonds
- Matchings in pentagonal chains
- On the number of entangled clusters
This page was built for publication: Cell Growth Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5564335)
