A recurrence-based convolutional method produces λ ≤ 4.5238 for polyomino growth rate with a concise self-contained proof and a general technique for bounding nonnegative recurrences.
Improved upper bounds on the growth constants of polyominoes and polycubes.Algorithmica, 84(12):3559–3586, 2022
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A convolutional approach to bounding the number of polyominoes
A recurrence-based convolutional method produces λ ≤ 4.5238 for polyomino growth rate with a concise self-contained proof and a general technique for bounding nonnegative recurrences.