1Dept. of Computer Science, Technion - Israel Inst.of Technology, Haifa, Israel 2Institut für Informatik, Freie Universität Berlin, Berlin, Germany 3Dept. of Computer Science, Stanford University, Stanford, USA
Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 429-436
Citer cet article
Gill Barequet; Guenter Rote; Mira Shalah; Gill Barequet; Guenter Rote; Mira Shalah. An improved upper bound on the growth constant of polyiamonds. Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 429-436. http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a11/
@article{AMUC_2019_88_3_a11,
author = {Gill Barequet and Guenter Rote and Mira Shalah and Gill Barequet and Guenter Rote and Mira Shalah},
title = { An improved upper bound on the growth constant of polyiamonds},
journal = {Acta mathematica Universitatis Comenianae},
pages = {429--436},
year = {2019},
volume = {88},
number = {3},
url = {http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a11/}
}
TY - JOUR
AU - Gill Barequet
AU - Guenter Rote
AU - Mira Shalah
AU - Gill Barequet
AU - Guenter Rote
AU - Mira Shalah
TI - An improved upper bound on the growth constant of polyiamonds
JO - Acta mathematica Universitatis Comenianae
PY - 2019
SP - 429
EP - 436
VL - 88
IS - 3
UR - http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a11/
ID - AMUC_2019_88_3_a11
ER -
%0 Journal Article
%A Gill Barequet
%A Guenter Rote
%A Mira Shalah
%A Gill Barequet
%A Guenter Rote
%A Mira Shalah
%T An improved upper bound on the growth constant of polyiamonds
%J Acta mathematica Universitatis Comenianae
%D 2019
%P 429-436
%V 88
%N 3
%U http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a11/
%F AMUC_2019_88_3_a11
A polyiamond is an edge-connected set of cells on the triangular lattice. Let~$T(n)$ denote the number of distinct (up to translation) polyiamonds made of~$n$ cells. It is known that the sequence~$T(n)$ has an asymptotic growth constant, i.e., the limit $\lambda_T := \lim_{n \to \infty} T(n+1) / T(n)$ exists, but the exact value of~$\lambda_T$ is still unknown. In this paper, we improve considerably the best known upper bound on~$\lambda_T$ from~4 to~3.6108.