An upper bound for the number of planar lattice triangulations (Q1406750)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1975843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the number of planar lattice triangulations |
scientific article; zbMATH DE number 1975843 |
Statements
An upper bound for the number of planar lattice triangulations (English)
0 references
7 September 2003
0 references
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)].
0 references
unimodular triangulations
0 references
0.8106550574302673
0 references
0.7812662124633789
0 references
0.7804656624794006
0 references
0.734649121761322
0 references
