Algorithms for counting minimum-perimeter lattice animals

DOI10.1007/s00453-022-01008-9OpenAlexW4289837227WikidataQ114229323 ScholiaQ114229323MaRDI QIDQ2700382

Gill Barequet, Gil Ben-Shachar

Publication date: 21 April 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-022-01008-9

zbMATH Keywords

lattice animalspolyominoespolyiamondspolyhexes

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A bijective approach to the area of generalized Motzkin paths
• On isoperimetrically optimal polyforms
• Polyiamonds and polyhexes with minimum site-perimeter and achievement games
• Counting polyominoes: yet another attack
• A pattern theorem for lattice clusters
• Enumerating polyominoes with fixed perimeter defect
• Polyominoes with minimum site-perimeter and full set achievement games
• A problem of arrangements
• Discrete Isoperimetric Problems
• Statistics of lattice animals (polyominoes) and polygons
• On Minimal Perimeter Polyminoes
• Cell Growth Problems
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Checker Boards and Polyominoes
• Improved upper bounds on the growth constants of polyominoes and polycubes
• Bijective recurrences for Motzkin paths

This page was built for publication: Algorithms for counting minimum-perimeter lattice animals