Asymptotic Number of Triangulations with Vertices in Z~2

摘要

Let J_n~2 be the set of all triangulations of the square [0, n]~2 with all the vertices belonging to Z~2. We show that Cn~2 < log Card J_n~2 < Dn~2.