Counting Lattice Triangulations

Details Counting Lattice Triangulations Counting Lattice Triangulations

2002-11-18

arxiv.org/abs/math/0211268v2

Mathematics

Combinatorics

30 pages, to appear in: ``British Combinatorial Surveys'' (C. D. Wensley, ed.), Cambridge University Press, 2003. This is an u

Scientific paper

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\times 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.

Affiliated with

Also associated with

No associations

Rating

Counting Lattice Triangulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Lattice Triangulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Lattice Triangulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508940