Satisfying states of triangulations of a convex n-gon

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 6 figures

Scientific paper

In this work we count the number of satisfying states of triangulations of a
convex n-gon using the transfer matrix method. We show an exponential (in n)
lower bound. We also give the exact formula for the number of satisfying states
of a strip of triangles.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Satisfying states of triangulations of a convex n-gon 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 Satisfying states of triangulations of a convex n-gon, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Satisfying states of triangulations of a convex n-gon will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-348622

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.