Ribbon graphs and meromorphic functions

B.Shapiro

arxiv: 2604.21358 · v1 · submitted 2026-04-23 · 🧮 math.AG · math.AT

Ribbon graphs and meromorphic functions

B.Shapiro This is my paper

Pith reviewed 2026-05-09 21:00 UTC · model grok-4.3

classification 🧮 math.AG math.AT

keywords ribbon graphsmeromorphic functionsRiemann surfacesimmersed graphsself-intersectionsgraph genusplanar graphsalgebraic geometry

0 comments

The pith

Ribbon graphs on a Riemann surface map under a meromorphic function to immersed graphs in the sphere, and every such immersion of an abstract multigraph without low-valence vertices arises this way from some surface and function.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes a two-way link between ribbon graphs on compact Riemann surfaces and immersed multigraphs in the complex projective line. Given a ribbon graph Gamma on Y that misses the critical points of a meromorphic function phi, the image phi(Gamma) forms an immersed graph in CP^1. Starting from any immersion of an abstract multigraph without vertices of valence 1 or 2, the authors construct a suitable Y and phi that recovers the immersed image exactly. This correspondence lets spanning ribbon graphs on a surface of genus g have any lower graph genus g' at most g, including the planar case, which shows that self-intersection counts in the image cannot be bounded by surface genus alone. General lower bounds on those intersections are derived and open problems are stated, with special attention to planar ribbon graphs.

Core claim

Let Y be a compact Riemann surface, phi:Y to CP^1 a meromorphic function, and Gamma in Y a ribbon graph avoiding the critical points of phi. Then phi(Gamma) is an immersed graph in CP^1. Conversely, given an immersion im:Theta to CP^1 of an abstract multigraph Theta without vertices of valence 1 or 2, there is a construction of a compact Riemann surface Y and a meromorphic function phi_im:Y to CP^1 such that phi_im(Gamma)=im(Theta). For a surface of genus g the authors construct spanning ribbon graphs whose underlying abstract graphs have any prescribed graph genus g' smaller than or equal to g, including the planar case. As a consequence the number of self-intersections of phi(Gamma) cannot

What carries the argument

The explicit construction that turns an immersion im of an abstract multigraph Theta (no valence-1 or valence-2 vertices) into a Riemann surface Y and meromorphic function phi_im whose image of a ribbon graph Gamma equals the immersed graph im(Theta).

If this is right

The topology of the surface Y is tied to the combinatorics of the ribbon graph Gamma, allowing spanning graphs of any graph genus g' at most the surface genus g.
Self-intersection numbers of the immersed image phi(Gamma) are not controlled solely by the genus of Y.
General lower bounds apply to the number of self-intersections of phi(Gamma) for any such pair.
Open problems exist concerning the minimal number of self-intersections, especially when the ribbon graph is planar.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The construction supplies a systematic way to produce examples of meromorphic functions whose graphs realize prescribed combinatorial data.
Because planar graphs appear as spanning subgraphs on surfaces of every genus, intersection numbers can be made arbitrarily large while keeping surface genus fixed.
The emphasis on planar ribbon graphs suggests examining whether the minimal self-intersection cases can be realized on genus-zero surfaces.

Load-bearing premise

The ribbon graph must avoid all critical points of the meromorphic function and the abstract multigraph must have no vertices of valence one or two.

What would settle it

An explicit immersion of an abstract multigraph without valence-1 or valence-2 vertices into CP^1 for which no compact Riemann surface Y and meromorphic phi exist making the image equal to phi of some ribbon graph on Y.

read the original abstract

Let Y be a compact Riemann surface, phi:Y -> CP^1 a meromorphic function, and Gamma in Y a ribbon graph avoiding the critical points of phi. Then phi(Gamma) is an immersed graph in CP^1. Conversely, given an immersion im:Theta to bCP^1 of an abstract multigraph Theta without vertices of valence 1 or 2, we describe a construction of a compact Riemann surface Y and a meromorphic function phi_{im}:Y in CP^1 such that phi_{im}(Gamma)=im(Theta). We investigate the relation between the topology of Y and the combinatorics of Gamma. In particular, for a surface of genus g we construct spanning ribbon graphs whose underlying abstract graphs have arbitrary prescribed graph genus g' smaller or equal g, including the planar case. As a consequence, the number of self-intersections of \phi(Gamma) cannot, in general, be controlled solely by the genus of Y. We establish general lower bounds for the number of self-intersections and formulate several open problems, with emphasis on planar ribbon graphs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper gives an explicit bidirectional construction between ribbon graphs avoiding critical points and immersed multigraphs in CP^1, plus a result that self-intersections cannot be bounded by surface genus alone.

read the letter

The main thing to know is that this paper gives an explicit construction turning an immersed multigraph in CP^1 into a Riemann surface with a meromorphic function that maps a ribbon graph onto it, and it proves that for any fixed genus you can choose spanning ribbon graphs with underlying graphs of any lower genus, so self-intersections of the image cannot be bounded by genus alone. The bidirectional construction is new as described, and the spanning result is a clear consequence that answers a natural question negatively. The paper states general lower bounds for self-intersections and lists open problems, especially for the planar case. It does well by keeping the conditions explicit: the graph must avoid critical points and the multigraph cannot have valence 1 or 2 vertices. This makes the claims precise. The soft spots are that these conditions restrict the class of objects covered, and without more examples it is difficult to see how often the constructions apply in practice or how sharp the bounds are. The paper stays combinatorial and does not push hard into algebraic geometry territory like ramification or moduli. This work is for combinatorial algebraic geometers or topologists interested in graphs on surfaces and their projections. Readers who study embeddings or want to model functions via graphs will find the correspondence and the open problems useful. The arguments appear free of circularity and the constructions are presented as independent, so the paper deserves a serious referee to verify the details. I recommend sending it out for peer review.

Referee Report

1 major / 3 minor

Summary. The paper claims to establish a correspondence: given a ribbon graph Gamma on a compact Riemann surface Y avoiding critical points of a meromorphic function phi: Y → CP¹, the image phi(Gamma) is an immersed graph in CP¹. Conversely, from an immersion of an abstract multigraph Theta (no valence-1 or -2 vertices) into the sphere, one can construct Y and phi_im such that the image recovers the immersion. It further shows that for fixed genus g of Y, one can find spanning ribbon graphs whose abstract graphs have any prescribed genus g' ≤ g (including planar), implying that self-intersection numbers of the images cannot be bounded by g alone, and provides general lower bounds for the number of self-intersections, along with open problems focused on planar cases.

Significance. If the constructions and bounds are correct, this provides a useful link between the combinatorics of ribbon graphs and the geometry of meromorphic functions on Riemann surfaces. The result on genus flexibility is particularly noteworthy, as it demonstrates that the topology of the surface does not constrain the complexity of the graph in terms of self-intersections in the way one might expect. The general lower bounds and the formulation of open problems add value by suggesting directions for future work in this intersection of algebraic geometry and topological graph theory. The approach appears constructive and independent of specific parameters.

major comments (1)

[Converse construction] The converse construction of the compact Riemann surface Y and meromorphic function phi_im from an immersion im: Theta → bCP¹ (abstract, no section or equation number given): the manuscript must explicitly verify that the resulting Gamma avoids the critical points of phi_im and that Y is compact, as these are load-bearing prerequisites for the claimed equality phi_im(Gamma) = im(Theta).

minor comments (3)

[Abstract] The abstract contains unclear notation: 'phi_im:Y in CP^1' should be 'phi_im : Y → CP¹' and 'bCP^1' should be clarified (likely the Riemann sphere).
[Introduction] Definitions of 'spanning ribbon graphs' and 'graph genus g'' are used without prior reference or citation; add these in the introduction or §1 for clarity.
[Final section] The open problems, especially those on planar ribbon graphs, would benefit from being stated as numbered questions or conjectures rather than informal remarks.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for the constructive comment on the converse construction. We address the point below and will revise the manuscript accordingly to strengthen the exposition.

read point-by-point responses

Referee: [Converse construction] The converse construction of the compact Riemann surface Y and meromorphic function phi_im from an immersion im: Theta → bCP¹ (abstract, no section or equation number given): the manuscript must explicitly verify that the resulting Gamma avoids the critical points of phi_im and that Y is compact, as these are load-bearing prerequisites for the claimed equality phi_im(Gamma) = im(Theta).

Authors: We agree that these two verifications are essential and should be stated explicitly rather than left implicit. In the revised version we will insert a short dedicated paragraph (with cross-references to the relevant equations in the construction) immediately after the description of the converse construction. We will verify (i) that Gamma is placed by construction in the complement of the critical points of phi_im, since the preimages under the local inverses are chosen in the regular locus of the branched covering, and (ii) that Y is compact because it is obtained by gluing finitely many compact pieces (closed disks and annuli) along their boundaries. These additions will make the prerequisites for the equality phi_im(Gamma) = im(Theta) fully explicit. revision: yes

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The paper describes an explicit bidirectional correspondence: ribbon graphs Gamma on Y avoiding critical points of meromorphic phi map to immersed graphs in CP^1, with a converse construction from immersed Theta (no valence-1/2 vertices) yielding Y and phi_im recovering the image. It further shows that for fixed genus g of Y one can realize spanning ribbon graphs with arbitrary graph genus g' ≤ g (including planar), implying self-intersections of phi(Gamma) are not controlled by g alone, and supplies general lower bounds. These are direct constructions and combinatorial arguments; no equations reduce to fitted inputs, no self-definitional loops, and no load-bearing self-citations appear in the provided text. The valence and avoidance conditions are stated upfront as prerequisites, making the derivation self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The claims rest on standard background from complex analysis and graph theory with no free parameters, new entities, or ad-hoc axioms visible in the abstract.

axioms (2)

standard math Standard properties of compact Riemann surfaces, meromorphic functions, and critical points
The setup assumes basic facts from Riemann surface theory and complex analysis.
domain assumption Definitions and immersion properties of ribbon graphs and abstract multigraphs without valence 1 or 2 vertices
The constructions rely on established combinatorial definitions of ribbon graphs and immersions.

pith-pipeline@v0.9.0 · 5477 in / 1313 out tokens · 37938 ms · 2026-05-09T21:00:31.171323+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

3 extracted references · 3 canonical work pages

[1]

6, 1219–1230

Zhi Yun Cheng, Hong Zhu Gao, Mutation on Knots and Whitney’s 2-Isomorphism Theorem, Acta Mathematica Sinica, English Series29(2013), no. 6, 1219–1230

work page 2013
[2]

Eremenko and A

A. Eremenko and A. Gabrielov, Irreducibility of some spectral determinants, arXiv:0904.1714

work page arXiv
[3]

4, 875–920

Motohico Mulase, Michael Penkava, Ribbon Graphs, Quadratic Differentials on Riemann Surfaces, and Algebraic Curves Defined over Q,Asian Journal of Mathematics2(1998), no. 4, 875–920. Department of Mathematics, Stockholm University, SE-106 91 Stockholm, Sweden Email address:shapiro@math.su.se

work page 1998

[1] [1]

6, 1219–1230

Zhi Yun Cheng, Hong Zhu Gao, Mutation on Knots and Whitney’s 2-Isomorphism Theorem, Acta Mathematica Sinica, English Series29(2013), no. 6, 1219–1230

work page 2013

[2] [2]

Eremenko and A

A. Eremenko and A. Gabrielov, Irreducibility of some spectral determinants, arXiv:0904.1714

work page arXiv

[3] [3]

4, 875–920

Motohico Mulase, Michael Penkava, Ribbon Graphs, Quadratic Differentials on Riemann Surfaces, and Algebraic Curves Defined over Q,Asian Journal of Mathematics2(1998), no. 4, 875–920. Department of Mathematics, Stockholm University, SE-106 91 Stockholm, Sweden Email address:shapiro@math.su.se

work page 1998