An upper bound for the number of planar lattice triangulations

DOI10.1016/S0097-3165(03)00097-9MaRDI QIDQ1406750zbMATH OpenOpenAlexFDO

Authors Emile E. Anclin

Publication date 7 September 2003

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0212140

zbMATH Keywords

unimodular triangulations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Abstract: We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $mimesn$ grid: [ f(m,n) < 2^{3mn}. ] In particular, this improves a result of S. Yu. Orevkov (1999).

Review text

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)].

Recommendations

• scientific article; zbMATH DE number 1996253
• Note on the number of triangulations of planar point sets
• A better upper bound on the number of triangulations of a planar point set
• Counting lattice triangulations: Fredholm equations in combinatorics
• The number of triangular islands on a triangular grid

Cites work

• Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 1996253 (Why is no real title available?)

Cited in

(11)

• The number of triangular islands on a triangular grid
• Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
• Counting polygon triangulations is hard
• Random lattice triangulations: structure and algorithms
• Skyscraper polytopes and realizations of plane triangulations
• scientific article; zbMATH DE number 7559233 (Why is no real title available?)
• The Number of Plane Diagrams of a Lattice
• Bounding the Kreuzer‐Skarke Landscape
• Counting lattice triangulations: Fredholm equations in combinatorics
• A Lyapunov function for Glauber dynamics on lattice triangulations
• Asymptotics of the number of primitive lattice triangulations of rectangles of width 4 and 5

This page was built for publication: An upper bound for the number of planar lattice triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1406750)