An upper bound for the number of planar lattice triangulations (Q1406750)

The author proves an upper bound for the number \(f(m,n)\) of unimodular triangulations of the planar grid of size \(m\times n\). It is shown that \(f(m,n)\leq 2^{3mn-m-n}\) for all \(m,n\geq 1\), improving substantially on a previous upper bound by \textit{S. Yu. Orevkov} [J. Comb. Theory, Ser. A 86, 200-203 (1999; Zbl 0920.05007)].