Systems of curves on non-orientable surfaces
Xiao Chen
TL;DR
The paper develops a comprehensive framework for maximal complete $1$-systems of loops and arcs on non-orientable surfaces, extending foundational results from orientable cases. It introduces and leverages geometric constructs such as lassos and honda paths for arcs, and a four-type decomposition of loops to derive tight lower and upper bounds, yielding quadratic growth in the Euler characteristic for non-orientable surfaces. It achieves an exact count for $n$-punctured projective planes and generalizes Przytycki’s arc bound to non-orientable settings, bridging a gap in the understanding of curve systems on non-orientable type surfaces. The results sharpen the contrast between orientable and non-orientable cases and provide explicit constructions and counting techniques that may inform further study of curve complexes and mapping class groups in non-orientable contexts.
Abstract
We show that the order of the cardinality of maximal complete $1$-systems of loops on non-orientable surfaces is $\sim |χ|^{2}$. In particular, we determine the exact cardinality of maximal complete $1$-systems of loops on punctured projective planes. To prove these results, we show that the cardinality of maximal systems of arcs pairwise-intersecting at most once on a non-orientable surface is $2|χ|(|χ|+1)$.
