New enumerative results on two-dimensional directed animals
An animal \(A\) on a graph \(G\) is a finite set of vertices of \(G\) which are connected in the sense that any two vertices of \(A\) are connected by a path in \(G\) having all its vertices in \(A\). These objects are of interest in statistical mechanics as well as combinatorics, since directed animals are related to directed (site) percolation models. Indeed, as shown by \textit{D. Dhar} [Equivalence of the two-dimensional directed site animal problem to Baxter's hard square lattice gas model, Phys. Rev. Lett. 49, 959-962 (1983); Exact solution of a directed-site animals-enumeration problem in three dimensions, Phys. Rev. Lett. 51, No. 10, 853-856 (1983)], enumerating directed animals on a certain graph corresponds to solving a hard particle model on a different graph. After a thorough review of results, methods and open problems in this field, the author extends Dhar's idea to show that many of the open questions reduce to finding the position generating function and the (bivariate) perimeter and area generating function for directed animals on square lattices. Moreover, each of these generating functions is essentially the density of a one-dimensional gas model given by the stationary distribution of a probabilistic transition. Although not solved in general, certain special cases give new bivariate generating functions for both square and triangular lattices from which several other generating function results follow as corollaries.
- Directed animals and gas models revisited
- A note on the enumeration of directed animals via gas considerations
- Generating functions for directed animals convex following their direction
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- Directed animals, quadratic systems and rewriting systems
- A Procedure for Improving the Upper Bound for the Number of n-Ominoes
- Animaux et arbres guingois. (Animals and guingois trees)
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- scientific article; zbMATH DE number 3856167 (Why is no real title available?)
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- Non-negative matrices and Markov chains. 2nd ed
- On the number of lattice animals embeddable in the square lattice
- Percolation models and animals
- Solvability of Some Statistical Mechanical Systems
- Some exact results for moments of 2D directed animals
- Directed animals, forests and permutations
- Haruspicy and anisotropic generating functions
- Algorithms for polyominoes based on the discrete Green theorem
- Lattice animals and heaps of dimers
- A method for the enumeration of various classes of column-convex polygons
- Generating functions for directed animals convex following their direction
- Bijections between directed animals, multisets and Grand-Dyck paths
- Probabilistic cellular automata with memory two: invariant laws and multidirectional reversibility
- Percolation games, probabilistic cellular automata, and the hard-core model
- Hole-free partially directed animals
- Probabilistic cellular automata and random fields with i.i.d. directions
- Haruspicy 3: The anisotropic generating function of directed bond-animals is not D-finite
- The discrete Green theorem and some applications in discrete geometry
- The number of directed compact site animals and extrapolation formula of directed percolation probability.
- Conjectures for the first perimeter moment of directed animals
- Exactly solved models
- Why are so many problems unsolved?
- Exhaustive generation of gominoes
- Distribution of transverse distances in directed animals
- Overview: PCA models and issues
- Directed animals, quadratic systems and rewriting systems
- Around probabilistic cellular automata
- Exact results for the generating function of directed column-convex animals on the square lattice
- Further results of enumeration of directed animals on two-dimensional lattices
- Markovianity of the invariant distribution of probabilistic cellular automata on the line
- From steady-state TASEP model with open boundaries to 1D Ising model at negative fugacity
- Parameter estimation in a subcritical percolation model with colouring
- Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling
- Directed and multi-directed animals on the king's lattice
- Transverse size of interacting directed lattice animals studied by Yang–Lee approach
- Structural properties of Potts model partition functions and chromatic polynomials for lattice strips
- Ergodicity of some probabilistic cellular automata with binary alphabet via random walks
- On a class of PCA with size-3 neighborhood and their applications in percolation games
- Lattice paths inside a table
- Cellular automata and percolation: an overview of selected connections
- The local limit of rooted directed animals on the square lattice
- Average site perimeter of directed animals on the two-dimensional lattices
- Equivalence of the two-dimensional directed animal problem to a one- dimensional path problem
- A note on the enumeration of directed animals via gas considerations
This page was built for publication: New enumerative results on two-dimensional directed animals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1381815)
