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 include the following. 1.We prove that λ2≤ 4.5252 ;2.We prove that λd≤ (2 d- 2) e+ o(1) for d≥ 2 (already improving significantly the known upper bound on λ3 to 9.8073); and3.We implement an iterative process in three dimensions, improving further the upper bound on λ3 to 9.3835.
Original language | English |
---|---|
Pages (from-to) | 3559-3586 |
Number of pages | 28 |
Journal | Algorithmica |
Volume | 84 |
Issue number | 12 |
DOIs | |
State | Published - Dec 2022 |
Keywords
- Cubical lattice
- Klarner’s constant
- Square lattice
All Science Journal Classification (ASJC) codes
- General Computer Science
- Applied Mathematics
- Computer Science Applications