Abstract:
Given a ribbon graph of arbitrary genus, we construct a spherical graph with the same two columns of the passport. And given a spherical graph, we present an algorithm for constructing a graph with the two columns of the same passport and any admissible genus. We also discuss possible applications to the theory of dessins d'enfants.
Citation:
Vik. S. Kulikov, G. B. Shabat, “Ribbon Graphs and Belyi Pairs with Partially Prescribed Branching”, Algebra and Arithmetic, Algebraic, and Complex Geometry, Collected papers. In memory of Academician Alexey Nikolaevich Parshin, Trudy Mat. Inst. Steklova, 320, Steklov Math. Inst., Moscow, 2023, 177–188; Proc. Steklov Inst. Math., 320 (2023), 161–171