An improved upper bound on the growth constant of polyiamonds
From MaRDI portal
Publication:6621157
Recommendations
- An improved lower bound on the growth constant of polyiamonds
- An improved lower bound on the growth constant of polyiamonds
- An improved upper bound on the growth constant of polyominoes
- The number of polyiamonds is supermultiplicative
- Improved upper bounds on the growth constants of polyominoes and polycubes
Cites work
- scientific article; zbMATH DE number 3169908 (Why is no real title available?)
- scientific article; zbMATH DE number 3397565 (Why is no real title available?)
- A pattern theorem for lattice clusters
- An improved lower bound on the growth constant of polyiamonds
- An improved upper bound on the growth constant of polyominoes
- Animals, Trees and Renewal Sequences
- Appendix: Series data and growth constant, amplitude and exponent estimates
- COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
- Cell Growth Problems
- Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
- The On-Line Encyclopedia of Integer Sequences
Cited in
(3)
This page was built for publication: An improved upper bound on the growth constant of polyiamonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621157)