Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes

Gill Barequet, Mira Shalah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A d-dimensional polycube is a face-connected set of cells on Zd. Let Ad(n) denote the number of d-dimensional polycubes (distinct up to translations) with n cubes, and λd denote their growth constant limn→∞Ad(n+1)Ad(n). We revisit and extend the method for the best known upper bound on A2(n). Our contributions: We (1) prove that λ2≤ 4.5252 ; (2) prove that λd≤ (2 d- 2 ) e+ o(1 ) for d≥ 2 (already improving significantly the upper bound on λ3 to 9.8073); and (3) implement an iterative process in 3D, improving further the upper bound on λ3 to 9.3835.

Original languageEnglish
Title of host publicationLATIN 2020
Subtitle of host publicationTheoretical Informatics - 14th Latin American Symposium 2021, Proceedings
EditorsYoshiharu Kohayakawa, Flávio Keidi Miyazawa
PublisherSpringer Science and Business Media Deutschland GmbH
Pages532-545
Number of pages14
ISBN (Print)9783030617912
DOIs
StatePublished - 2020
Event14th Latin American Symposium on Theoretical Informatics, LATIN 2020 - Sao Paulo, Brazil
Duration: 5 Jan 20218 Jan 2021

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12118 LNCS

Conference

Conference14th Latin American Symposium on Theoretical Informatics, LATIN 2020
Country/TerritoryBrazil
CitySao Paulo
Period5/01/218/01/21

Keywords

  • Cubical lattice
  • Klarner’s constant
  • Square lattice

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Improved Upper Bounds on the Growth Constants of Polyominoes and Polycubes'. Together they form a unique fingerprint.

Cite this