Show simple item record

Authordc.contributor.authorJiménez, A. 
Authordc.contributor.authorKiwi Krauskopf, Marcos es_CL
Authordc.contributor.authorLoebl, Martín es_CL
Admission datedc.date.accessioned2010-06-21T20:03:48Z
Available datedc.date.available2010-06-21T20:03:48Z
Publication datedc.date.issued2010
Cita de ítemdc.identifier.citationThe electronic journal of combinatorics 17 (2010), #R39en_US
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/125360
Abstractdc.description.abstractIn 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.en_US
Patrocinadordc.description.sponsorshipGratefully 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.en_US
Lenguagedc.language.isoenen_US
Títulodc.titleSatisfying states of triangulations of a convex n-gonen_US
Document typedc.typeArtículo de revista


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record