Counting surface branched covers
From MaRDI portal
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.
Recommendations
Cited in
(8)- SOLUTION OF THE HURWITZ PROBLEM FOR LAURENT POLYNOMIALS
- Realizations of certain odd-degree surface branch data
- Solution of the Hurwitz problem with a length-2 partition
- The Hurwitz existence problem for surface branched covers
- Branched covers of the sphere and the prime-degree conjecture
- Enumeration of branched coverings of closed orientable surfaces whose branch orders coincide with multiplicity
- Branched coverings of riemann surfaces whose branch orders coincide with the multiplicity
- Construction of covering maps between orientable surfaces
This page was built for publication: Counting surface branched covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244454)