Satisfying states of triangulations of a convex n-gon
Jimenez_A.pdf (345.4Kb)Abstract
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.
Patrocinador
Gratefully acknowledges the support of Mecesup via UCH0607 Project, CONICYT via Basal-
FONDAP in Applied Mathematics, FONDECYT 1090227 and the partial support of the Czech Research
Grant MSM 0021620838 while visiting KAM MFF UK. Gratefully acknowledges the support of CONICYT via Basal-FONDAP in Applied Mathematics and
FONDECYT 1090227. Partially supported by Basal project Centro de Modelamiento Matem´atico, Universidad de Chile.
Identifier
URI: https://repositorio.uchile.cl/handle/2250/125360
Quote Item
The electronic journal of combinatorics 17 (2010), #R39
Collections