A short proof of an upper bound on the growth constant of polyiamonds
Combinatorics
2026-01-19 v2
Abstract
We provide a short and elementary proof that the growth constant of polyiamonds is at most for the unique real root of the equation . This coincidentally suffices to recover the best known upper bound . Unlike the previous proof of this bound, which relied on computer-assisted technical arguments and the counts of polyiamonds with up to 75 triangles, our method is based on a straightforward recurrence that can be verified by hand with minimal effort.
Cite
@article{arxiv.2510.06806,
title = {A short proof of an upper bound on the growth constant of polyiamonds},
author = {Vuong Bui},
journal= {arXiv preprint arXiv:2510.06806},
year = {2026}
}
Comments
6 pages, 3 figures; title changed, and some minor revision before publication