Counting surface branched covers
Carlo Petronio, Filippo Sarti

TL;DR
This paper investigates the enumeration of branched covers of surfaces with given branch data, revealing only three distinct counts under various natural equivalence relations using Grothendieck's dessins d'enfant.
Contribution
It classifies the number of distinct branched covers for a given branch datum, showing only three possible counts under different natural restrictions.
Findings
Number of distinct branched covers is always three under various conditions.
Uses Grothendieck's dessins d'enfant to distinguish the counts.
Provides a detailed analysis of the Hurwitz problem and its refinements.
Abstract
To a branched cover f between orientable surfaces one can associate a certain branch datum D(f), that encodes the combinatorics of the cover. This D(f) satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but still partly unsolved Hurwitz problem asks whether for a given abstract compatible branch datum D there exists a branched cover f such that D(f)=D. One can actually refine this problem and ask how many these f's exist, but one must of course decide what restrictions one puts on such f's, and choose an equivalence relation up to which one regards them. And it turns out that quite a few natural choices are possible. In this short note we carefully analyze all these choices and show that the number of actually distinct ones is only three. To see that these three choices are indeed different we employ Grothendieck's dessins d'enfant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Counting surface branched covers
Carlo Petronio Partially supported by INdAM through GNSAGA, by MIUR through PRIN “Real and Complex Manifolds: Geometry, Topology and Harmonic Analysis” and by UniPI through PRA 2018/22 “Geometria e Topologia delle varietà”
Filippo Sarti
Abstract
To a branched cover between orientable surfaces one can associate a certain branch datum , that encodes the combinatorics of the cover. This satisfies a compatibility condition called the Riemann-Hurwitz relation. The old but still partly unsolved Hurwitz problem asks whether for a given abstract compatible branch datum there exists a branched cover such that . One can actually refine this problem and ask how many these ’s exist, but one must of course decide what restrictions one puts on such ’s, and choose an equivalence relation up to which one regards them. And it turns out that quite a few natural choices are possible. In this short note we carefully analyze all these choices and show that the number of actually distinct ones is only three. To see that these three choices are indeed different we employ Grothendieck’s dessins d’enfant.
MSC (2010): 57M12.
Quite some energy has been devoted in ancient and more recent times to the computation of the so-called Hurwitz numbers, namely the numbers of equivalence classes of branched covers matching given branch data, see for instance [10, 11, 4, 7, 8, 9, 12, 17, 18]. However there are several natural a priori different ways to define the Hurwitz numbers exactly. In fact, one can decide to insist or not that a branched cover should respect the orientation, and to require or not that the branching points should be some fixed marked ones. Analogously, one can decide to include or not the orientation and/or the marking in the notion of equivalence. In this paper we carefully list and analyze all these possibilities, and we show that actually only three of them are really distinct. Our results and techniques have a rather elementary nature, but to the best of our knowledge no explicit account exists in the literature of all the possible ways under which the problem of counting surface branched covers could be faced. Two of the three different notions of equivalence however appear in [6], see the end of Section 3 for a discussion on this point.
1 Branched covers, branch data,
and the Hurwitz problem
A surface branched cover is a map
[TABLE]
where and are closed and connected surfaces and is locally modeled on maps of the form
[TABLE]
If the point [math] in the target is called a branching point, and is called the local degree at the point [math] in the source . There are finitely many branching points, removing which, together with their preimages, one gets a genuine cover of some degree . If there are branching points and we order them in some arbitrary fashion, the local degrees at the preimages of the -th point form a partition of , and we define
[TABLE]
to be a branch datum associated to (the datum is not unique because an order of the branching points has been chosen). If has length , the following Riemann-Hurwitz relation holds:
[TABLE]
Let us now call abstract branch datum a 5-tuple
[TABLE]
a priori not coming from any , and let us say it is compatible if it satisfies the Riemann-Hurwitz relation. (For a non-orientable and/or this relation should actually be complemented with certain other necessary conditions, but we restrict to an orientable in this paper, so we do not spell out these conditions here.)
The Hurwitz problem
The very old Hurwitz problem asks which compatible abstract branch data are realizable, namely, such that there exists with for some ordering of the branching points of , and which are exceptional (non-realizable). Several partial solutions to this problem have been obtained over the time, and we quickly mention here the fundamental [3], the survey [16], and the more recent [13, 14, 15, 2, 19]. In particular, for an orientable the problem has been shown to have a positive solution whenever has positive genus. When is the sphere , many realizability and exceptionality results have been obtained (some of experimental nature), but the general pattern of what data are realizable remains elusive. One guiding conjecture in this context is that a compatible branch datum is always realizable if its degree is a prime number. It was actually shown in [3] that proving this conjecture in the special case of branching points would imply the general case. This is why many efforts have been devoted in recent years to investigating the realizability of compatible branch data with base surface the sphere and having branching points. See in particular [14, 15] for some evidence supporting the conjecture.
2 As many as 12 counting methods
In this section and in the next one,
[TABLE]
will be a fixed but arbitrary abstract compatible branch datum. Note that and are supposed to be specific surfaces, they are not viewed up to any type of equivalence. Moreover we assume they have a fixed orientation, and we also fix points in . In the sequel we will call positive a map that respects the orientation.
We will say that a branched cover is:
- •
A realization of if for some order of the branching points;
- •
A positive realization of if it is a realization and away from the branching points is a positive local homeomorphism;
- •
A marked realization if the branching points of are and the partition of given by the local degrees of at the preimages of is ;
- •
A marked positive realization if it is both a marked realization and a positive one.
Note that a marked realization of is a realization. We denote by
[TABLE]
respectively the set of all the realizations of , the positive realizations, the marked realizations, the marked positive realizations. For all and where are empty or , except that must be empty if is, and are empty or , we define a quotient of , where two realizations in are identified if there exists a commutative diagram
[TABLE]
with homeomorphisms, and:
- •
is the identity if ;
- •
and are positive if .
So we have the quotients
[TABLE]
From the definitions it immediately follows that the following maps are defined:
- •
the quotient maps
- •
the quotient maps
- •
the inclusions
- •
the forgetful maps
Therefore we get the following commutative diagram
[TABLE]
where to save space we have omitted any explicit reference to .
3 At most three methods are distinct
In this section we show that several of the maps in the above commutative diagram are actually bijections or otherwise easily understood.
Proposition 3.1**.**
* is a bijection.*
Proof.
If are equivalent in then there exists a commutative diagram as (1) with the identity. But and are positive, so also is, whence and are equivalent in . ∎
Proposition 3.2**.**
* and are bijections.*
Proof.
We spell out the argument for , the other two cases are identical. Fix a negative involutive automorphism of . Our aim is to define an inverse of . To do so for we set
[TABLE]
and we prove the following:
Fact: is well-defined Note first that if , so it makes sense to take . Assume now are equivalent in , so there exists a commutative diagram as (1). We have four cases:
- •
If the same diagram shows that and are equivalent in ;
- •
If and then and are equivalent in because we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma}$$\scriptstyle{\rho\,{\scriptstyle\circ}\,{\widetilde{h}}}$$\scriptstyle{f}$$\scriptstyle{f^{\prime}\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{h}
(recall that is involutive, so is the identity of );
- •
If and then and are equivalent in because we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma;}$$\scriptstyle{{\widetilde{h}}\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{f\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{f^{\prime}}$$\scriptstyle{h}
- •
If then and are equivalent in because we have the commutative diagram
[TABLE]
Fact: is a left inverse of This is immediate: for we have , whence .
Fact: is a right inverse of Given we have two cases; if then , so ; if then , so , but we actually have that and are equivalent in , because we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma.}$$\scriptstyle{\rho}$$\scriptstyle{f\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{f}$$\scriptstyle{\mathrm{id}}
The proof is complete. ∎
Proposition 3.3**.**
* and are bijections.*
Proof.
We begin with and we construct its inverse . Given , suppose that has branching points ordered so that the local degrees of over form the partition of . We then choose an automorphism of such that for all and set . We have the following:
Fact: is well-defined Note first that indeed . Moreover is independent of , because if is another automorphism of such that for all we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma.}$$\scriptstyle{\mathrm{id}}$$\scriptstyle{g\,{\scriptstyle\circ}\,f}$$\scriptstyle{g^{\prime}\,{\scriptstyle\circ}\,f}$$\scriptstyle{g^{\prime}\,{\scriptstyle\circ}\,g^{-1}}
Suppose now that are equivalent in , so there exists a commutative diagram as (1); let and be the branching points of and ordered so that the local degrees of over and those of over form the partition of . Take automorphisms and of such that for all . Then and are equivalent in because we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma.}$$\scriptstyle{{\widetilde{h}}}$$\scriptstyle{g\,{\scriptstyle\circ}\,f}$$\scriptstyle{g^{\prime}\,{\scriptstyle\circ}\,f^{\prime}}$$\scriptstyle{g^{\prime}\,{\scriptstyle\circ}\,h\,{\scriptstyle\circ}\,g^{-1}}
Fact: is a left inverse of Given we know that the branching points of are with associated partitions , so in the definition of we can take and it readily follows that
[TABLE]
Fact: is a right inverse of Take and suppose that is defined as . Then
[TABLE]
but is equivalent to in because we have the commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma.}$$\scriptstyle{\mathrm{id}}$$\scriptstyle{f}$$\scriptstyle{g\,{\scriptstyle\circ}\,f}$$\scriptstyle{g}
This concludes the argument for . Repeating it for only requires to remark that the automorphism of used to define can always be chosen to be positive. The extension to and is straight-forward. ∎
Proposition 3.4**.**
There exist natural projections
[TABLE]
having and as sections, so can be identified to two copies of , and can be identified to two copies of .
Proof.
As in the proof of Proposition 3.2 we fix a negative involutive automorphism of . We spell out the proof for ; the version for is identical. For we set
[TABLE]
and we have the following:
Fact: is well-defined For we have , so it makes sense to take . If are equivalent in then there exists a commutative diagram as (1) with and positive. It follows that either or . In the former case the same diagram shows that and are equivalent in . In the latter case a commutative diagram as (2) shows that and are equivalent in .
Fact: is For we have that certainly contains and . Conversely, suppose that . We have two cases. Either , whence , which implies that in and hence in particular in . Or , so , whence in ; this implies that we have a commutative diagram
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma}$$\scriptstyle{{\widetilde{h}}}$$\scriptstyle{f\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{g}$$\scriptstyle{h}
whence
{{\widetilde{\Sigma}}}$${{\widetilde{\Sigma}}}$${\Sigma}$${\Sigma,}$$\scriptstyle{\rho\,{\scriptstyle\circ}\,{\widetilde{h}}\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{f}$$\scriptstyle{g\,{\scriptstyle\circ}\,\rho}$$\scriptstyle{h}
therefore in . Now we note that and cannot be equivalent in and the claimed fact is proved.
Fact: is a section of This is immediate, because for we have and . ∎
The results proved so far imply that of the potentially distinct only three remain to understand, because
[TABLE]
Note that each is a finite set (see also Section 4) and does not carry any significant algebraic structure, so only its cardinality actually matters. In the rest of the paper we will concentrate on
[TABLE]
and prove that they can indeed differ from each other. Note that by construction
[TABLE]
and they can only vanish simultaneously.
We remark here that our is called in [6] the set of rigid equivalence classes of branched covers matching , while is called the set of flexible equivalence classes. From this viewpoint, we could call the set of very flexible equivalence classes.
4 Dessins d’enfant
Graphs on surfaces have been used for a long time to understand surface branched covers, see [6]; their version for the case where is the sphere and the number of branching point is has been popularized by Grothendieck under the name of dessins d’enfant, and pushed to its most ultimate algebraic consequences, see [5] and [1]. In this paper we will adopt a purely topological viewpoint, neglecting the algebraic one altogether.
Let us call graph a cellular -complex , consisting of vertices and edges (we do not insist that should be simplicial, so loops and multiple edges are allowed). We say that is bipartite if its vertices are coloured black and white, and every edge joins black to white. We then call dessin d’enfant on a bipartite graph embedded in so that the complement of consists of open discs, called regions. The length of a region of is now the number of black (or white) vertices it is incident to (with multiplicity).
In the rest of this section we fix a branch datum with base surface the sphere and branching points, so
[TABLE]
The results we prove here could be extracted from the literature [6], but we spell them out for the sake of completeness. We will denote by the set of dessins d’enfant on such that the valences of the black vertices of give the partition of , the valences of the white vertices give , while the lengths of the regions of give . We define the quotient of under the action of the positive automorphisms of .
Proposition 4.1**.**
There is a natural bijection between and .
Proof.
Take and recall that the branching points of are the fixed points , with associated partitions of , in this order. Now choose in a simple arc joining to , paint black and white, and define , with vertex colours lifted through . Since is unique up to isotopy fixed on and , the dessin d’enfant is well-defined up to positive automorphisms of . Moreover, by the definition of the equivalence relation giving , we see that only depends on .
Conversely, given , we can choose in a simple arc joining to , and map continuously to sending the black vertices to , the white vertices to , and each edge bijectively onto . We can now extend this map continuously to each complementary region of , in such a way that is mapped onto and there is only one branching point in the interior of , mapped to with local degree equal to the length of . Patching these extensions together we get a branched cover in , and it is a routine matter to check that only depends on .
The two maps and are the inverse of each other, whence the conclusion. ∎
We next define a further quotient where two elements of are identified if two of their representatives can be obtained from each other by a combination of the following moves :
- •
equals as a graph, but the black and white colours of the vertices are switched;
- •
has the same black vertices as , one white vertex in the interior of each complementary region of , and disjoint edges contained in joining this white vertex to the black vertices adjacent to .
Note that a single move might lead from a dessin in to one outside , but then a further move might lead back to . Note also that if are distinct then .
Proposition 4.2**.**
There is a natural bijection between and .
Proof.
Recall that we have a natural surjection and that is identified to via . Take and suppose that . Then there exists a diagram as (1) with positive . Choose in arcs and joining to , with a black end at and a white end at , so the equivalence classes in of and correspond to the elements and of . Now need not be isotopic to with isotopy fixed at the ends, because it will have its black end at some and its white end at some (but note that we must have and ). However becomes , up to isotopy fixed at the ends, by a combination of the following moves applied to an arc:
- •
Switch the colours of the ends of the arc;
- •
Supposing the black end is at and the white end is at , replace the arc by one with black end at and white end at .
This implies that becomes by a combination of the moves defining the equivalence in , so in . The same construction shows that if in then , whence the conclusion. ∎
As a final step, we take the quotient of by allowing the action of the negative automorphisms of as well. Then we easily have:
Proposition 4.3**.**
There is a natural bijection between and .
5 Precisely three methods are distinct
By the results of the previous section, all we must show to conclude that
[TABLE]
are distinct in some cases, is to show that each of the natural projections
[TABLE]
can fail to be a bijection. Note first that given
[TABLE]
there are finitely many abstract bipartite graphs with valences of the black vertices the entries of and valences of the white vertices the entries of . Each of these graphs embeds in in only a finite number of ways up to automorphisms of , so is always a finite set. Even if we will not need this here, we note that variants of the argument based on dessins d’enfant prove that is always a finite set, so and also are.
Let us now consider the branch datum
[TABLE]
An easy enumeration argument proves that has elements, with representatives shown in Fig. 1.
Now one sees that the graphs and are obtained from each other by a switch of colours, and the same happens for and , and for and . Note that only the switch of colours is relevant to understand the projection , because , so we conclude that has elements. We must now analyze what equivalence classes in are related by a reflection in , and we see that it happens precisely for those of and , and for those of and . This implies that has elements. Therefore
[TABLE]
Without providing the details we also note that in the relation
[TABLE]
all the possibilities for the relations occur in reality; for instance
[TABLE]
[TABLE]
[TABLE]
To conclude we note that the Hurwitz numbers computed in [10, 11] are , while those computed in [17, 18] are .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. B. Cohen (now P. Tretkoff), Dessins d’enfant and Shimura varieties , In: “The Grothendieck Theory of Dessins d’Enfants,” (L. Schneps, ed.), London Math. Soc. Lecture Notes Series, Vol. 200, Cambridge University Press, 1994, pp. 237-243.
- 2[2] P. Corvaja – C. Petronio – U. Zannier, On certain permutation groups and sums of two squares , Elem. Math. 67 (2012), 169-181.
- 3[3] A. L. Edmonds – R. S. Kulkarni – R. E. Stong , Realizability of branched coverings of surfaces , Trans. Amer. Math. Soc. 282 (1984), 773-790.
- 4[4] I. P. Goulden – J. H. Kwak – J. Lee , Distributions of regular branched surface coverings , European J. Combin. 25 (2004), 437-455.
- 5[5] A. Grothendieck , Esquisse d’un programme (1984) . In: “Geometric Galois Action” (L. Schneps, P. Lochak eds.), 1: “Around Grothendieck’s Esquisse d’un Programme,” London Math. Soc. Lecture Notes Series, Vol. 242, Cambridge Univ. Press, 1997, pp. 5-48.
- 6[6] S. K. Lando – A. K. Zvonkin , “Graphs on Surfaces and their Applications,” Encyclopaedia Math. Sci. Vol. 141, Springer, Berlin, 2004.
- 7[7] J. H. Kwak, A. Mednykh , Enumeration of branched coverings of closed orientable surfaces whose branch orders coincide with multiplicity , Studia Sci. Math. Hungar. 44 (2007), 215-223.
- 8[8] J. H. Kwak, A. Mednykh , Enumerating branched coverings over surfaces with boundaries , European J. Combin. 25 (2004), 23-34.
