Pages that link to "Item:Q4889240"
From MaRDI portal
The following pages link to Enumerating 2D percolation series by the finite-lattice method: theory (Q4889240):
Displaying 13 items.
- Code for polyomino and computer search of isospectral polyominoes (Q512885) (← links)
- On column-convex and convex Carlitz polyominoes (Q2071544) (← links)
- A decomposition of column-convex polyominoes and two vertex statistics (Q2155173) (← links)
- Smooth column convex polyominoes (Q2167315) (← links)
- On the complexity of Jensen's algorithm for counting fixed polyominoes (Q2457308) (← links)
- Rooted spiral trees on hyper-cubic lattices (Q2481427) (← links)
- λ > 4 (Q3452770) (← links)
- Exact Enumerations (Q3651684) (← links)
- (Q5210579) (← links)
- Synergistic development of differential approximants and the finite lattice method in lattice statistics (Q5269454) (← links)
- The design of efficient dynamic programming and transfer matrix enumeration algorithms (Q5363387) (← links)
- Improved upper bounds on the growth constants of polyominoes and polycubes (Q5970780) (← links)
- Loops and regions in Hitomezashi patterns (Q6080150) (← links)