Enumerating 2D percolation series by the finite-lattice method: theory
From MaRDI portal
Publication:4889240
Recommendations
- Low-density series expansions for directed percolation: III. Some two-dimensional lattices
- Percolation analysis of the two-dimensional Widom-Rowlinson lattice model
- Series expansions of the percolation probability for directed square and honeycomb lattices
- Series expansion of the percolation probability for the directed square lattice
- Some two-dimensional finite energy percolation processes
- Series expansion of the percolation threshold on hypercubic lattices
- Hypergeometric series in a series expansion of the directed-bond percolation probability on the square lattice
- Factorization formulas for 2D critical percolation, revisited
- Exact site percolation thresholds for a class of two-dimensional lattices
- On two-dimensional percolation
Cited in
(13)- The design of efficient dynamic programming and transfer matrix enumeration algorithms
- Rooted spiral trees on hyper-cubic lattices
- On the complexity of Jensen's algorithm for counting fixed polyominoes
- Improved upper bounds on the growth constants of polyominoes and polycubes
- Synergistic development of differential approximants and the finite lattice method in lattice statistics
- Loops and regions in Hitomezashi patterns
- Exact enumerations
- \(\lambda > 4\)
- Enumerations on bargraphs
- On column-convex and convex Carlitz polyominoes
- A decomposition of column-convex polyominoes and two vertex statistics
- Smooth column convex polyominoes
- Code for polyomino and computer search of isospectral polyominoes
This page was built for publication: Enumerating 2D percolation series by the finite-lattice method: theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4889240)
