Asymptotics of the number of lattice triangulations of rectangles of width 4 and 5

Abstract

Let $f(m,n)$ be the number of primitive lattice triangulations of an $m\times n$ rectangle. We express the limits ${\lim }_{n}f(m,n{)}^{1/n}$ for $m=4$ and $m=5$ in terms of certain systems of Fredholm integral equations on generating functions (the case $m\le 3$ was treated in a previous paper). Solving these equations numerically, we compute approximate values of these limits with a rather high precision.

v2: Section 5 is updated; Section 6 is added. v3: Section 5 is updated