Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-08T08:06:51.121Z Has data issue: false hasContentIssue false

7 - Counting lattice triangulations

Published online by Cambridge University Press:  05 May 2013

V. Kaibel
Affiliation:
Technische Universität Berlin
G.M. Ziegler
Affiliation:
Technische Universität Berlin
C. D. Wensley
Affiliation:
University of Wales, Bangor
Get access

Summary

Abstract

We discuss the problem to count, or, more modestly, to estimate the number f(m, n) of unimodular triangulations of the planar grid of size m × n.

Among other tools, we employ recursions that allow one to compute the (huge) number of triangulations for small m and rather large n by dynamic programming; we show that this computation can be done in polynomial time if m is fixed, and present computational results from our implementation of this approach.

We also present new upper and lower bounds for large m and n, and we report about results obtained from a computer simulation of the random walk that is generated by flips.

Introduction

An innocent little combinatorial counting problem asks for the number of triangulations of a finite grid of size m × n. That is, for m,n ≥ 1 we define Pm,n := {0,1,…, m} × {0,1,…, n}, “the grid”. Equivalently, the point configuration Pm,n consists of all points of the integer lattice Z2 in the lattice rectangle conv(Pm,n) = [0, m] × [0, n] of area mn. Every triangulation of this rectangle point set that uses all the points in Pm,n has (m + 1)(n + 1) = ∣Pm, n∣ vertices, 2mn facets/triangles, and 3mn + m + n edges, 2 (m + n) of them on the boundary, the other 3mnmn ones in the interior. All the triangles are minimal lattice triangles of area ½ (that is, of determinant 1), which are referred to as unimodular triangles.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×