An improved lower bound on the growth constant of polyiamonds

DOI10.1007/s10878-018-0336-0zbMath1420.90073OpenAlexW4232056745MaRDI QIDQ5971174

Gill Barequet, Yufei Zheng, Mira Shalah

Publication date: 6 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0336-0

zbMATH Keywords

lattice animalspolyiamondsgrowth constant

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Polyominoes (05B50) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05)

Related Items (3)

The number of polyiamonds is supermultiplicative ⋮ Extremal \(\{ p, q\}\)-animals ⋮ Concatenation arguments and their applications to polyominoes and polycubes

Uses Software

• OEIS

Cites Work

• Polygons, polyominoes and polycubes
• Counting polyominoes: yet another attack
• A pattern theorem for lattice clusters
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Animals, Trees and Renewal Sequences
• COUNTING d-DIMENSIONAL POLYCUBES AND NONRECTANGULAR PLANAR POLYOMINOES
• Cell Growth Problems
• A Procedure for Improving the Upper Bound for the Number of n-Ominoes
• An improved lower bound on the growth constant of polyiamonds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved lower bound on the growth constant of polyiamonds