Skip to content

Minimal Filling pair of non orientable surfaces

Debattam Das, Souvik Pal, Bidyut Sanki

math.GTarXiv:2608.18848

Abstract

For g 3, let Ng denote the non-orientable surface of genus g. In this article, we establish the existence of filling pairs on Ng that intersect minimally by construction using the theory of fat graphs. The mapping class group Mod(Ng) acts on the set of all such filling pairs. We count Mod(Ng)-orbits of this action by providing both lower and upper bounds. Furthermore, we show that both bounds grow super-exponentially with g using graph cohomology. Also, we investigate the lengths of minimally intersecting filling pairs on hyperbolic non-orientable surfaces X in moduli space Mg of Ng. We define a function Fg:Mg>0, where for X∈ Mg, the function Fg(X) is the shortest total length of a minimally intersecting filling pair on X. We determine its minimum mg and show that the set of minimizers is in bijection with the \(Mod(Ng)\)-orbits of minimally intersecting filling pairs. We further extend \(Fg\) to \(Yg\), defined by minimizing the length over all filling pairs, and show that \(Yg\) attains the same minimum value as \(Fg\).

Create a lesson