A classification of rotary embeddings of multicycles
Abstract
We classify rotary (orientably-regular) maps whose underlying graphs are multicycles. For the multicycle Cn(λ) of length n and edge-multiplicity λ, we determine all rotary embeddings for n≥slant 3 and λ≥slant 2. When n is odd, there is a unique isomorphism class; when n is even, the embeddings form a family Mn(λ)(i,j) parameterized by integer pairs (i,j) satisfying explicit congruence conditions.
0
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.