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.
A procedure for improving the upper bound for the number of n-ominoes.Canadian Journal of Mathematics, 25(3):585–602, 1973
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.