Flip-graphs of non-orientable filling surfaces
Abstract
Consider a surface with punctures that serve as marked points and at least one marked point on each boundary component. We build a filling surface n by singling out one of the boundary components and denoting by n the number of marked points it contains. We consider the triangulations of n whose vertices are the marked points and the associated flip-graph F(n). Quotienting F(n) by the homeomorphisms of that fix the privileged boundary component results in a finite graph MF(n). Bounds on the diameter of MF(n) are available when is orientable and we provide corresponding bounds when is non-orientable. We show that the diameter of this graph grows at least like 5n/2 and at most like 4n as n goes to infinity. If is an unpunctured M\"obius strip, MF(n) coincides with F(n) and we prove that the diameter of this graph grows exactly like 5n/2 as n goes to infinity.
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.