English

Elementary elliptic $(R,q)$-polycycles

Combinatorics 2007-05-23 v1

Abstract

We consider the following generalization of the decomposition theorem for polycycles. A {\em (R,q)(R,q)-polycycle} is, roughly, a plane graph, whose faces, besides some disjoint {\em holes}, are ii-gons, iRi \in R, and whose vertices, outside of holes, are qq-valent. Such polycycle is called {\em elliptic}, {\em parabolic} or {\em hyperbolic} if 1q+1r1/2\frac{1}{q} + \frac{1}{r} - {1/2} (where r=maxiRir={max_{i \in R}i}) is positive, zero or negative, respectively. An edge on the boundary of a hole in such polycycle is called {\em open} if both its end-vertices have degree less than qq. We enumerate all elliptic {\em elementary} polycycles, i.e. those that any elliptic (R,q)(R,q)-polycycle can be obtained from them by agglomeration along some open edges.

Keywords

Cite

@article{arxiv.math/0507562,
  title  = {Elementary elliptic $(R,q)$-polycycles},
  author = {Michel Deza and Mathieu Dutour and Mikhail Shtogrin},
  journal= {arXiv preprint arXiv:math/0507562},
  year   = {2007}
}