Elementary elliptic (R,q)-polycycles
Abstract
We consider the following generalization of the decomposition theorem for polycycles. A (R,q)-polycycle is, roughly, a plane graph, whose faces, besides some disjoint holes, are i-gons, i ∈ R, and whose vertices, outside of holes, are q-valent. Such polycycle is called elliptic, parabolic or hyperbolic if 1q + 1r - 1/2 (where r=maxi ∈ Ri) is positive, zero or negative, respectively. An edge on the boundary of a hole in such polycycle is called open if both its end-vertices have degree less than q. We enumerate all elliptic elementary polycycles, i.e. those that any elliptic (R,q)-polycycle can be obtained from them by agglomeration along some open edges.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.