Skip to main content Accessibility help
×
Home

Enumerating Branched Surface Coverings from Unbranched Ones

  • Jin Ho Kwak (a1), Jaeun Lee (a2) and Alexander Mednykh (a3)

Abstract

The number of non-isomorphic n-fold branched coverings of a given closed surface can be determined by the number of nonisomorphic n-fold unbranched coverings of the surface and the number of nonisomorphic connected n-fold graph coverings of a suitable bouquet of circles. A similar enumeration can also be done for regular branched coverings. Some explicit enumerations are also possible.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Enumerating Branched Surface Coverings from Unbranched Ones
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Enumerating Branched Surface Coverings from Unbranched Ones
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Enumerating Branched Surface Coverings from Unbranched Ones
      Available formats
      ×

Copyright

References

Hide All
1Berstein, I. and Edmonds, A.L., ‘On the construction of branched coverings of low-dimensional manifolds’, Trans. Amer. Math. Soc. 247 (1979) 87124.
2Berstein, I. and Edmonds, A. L., ‘On the classification of generic branched coverings of surfaces’, Illinois J. Math. 28 (1984) 6482.
3Gross, J. L. and Tucker, T.W., ‘Generating all graph coverings by permutation voltage assignments’, Discrete Math. 18 (1977) 273283.
4Gross, J. L. and Tucker, T. W., Topological graph theory (Wiley, New York, 1987).
5Hirsch, U., ‘On regular homotopy of branched coverings of the sphere’, Manuscripta Math. 21 (1977) 293306.
6Hurwitz, A., ‘Uber Riemann'sche Flächen mit gegebenen Verzweigungspimkten’, Math. Ann. 39 (1891) 160.
7Jones, G.A., ‘Enumeration of homomorphisms and surface-coverings’, Quart. J. Math. Oxford (2) 46 (1995) 485507.
8Jones, G.A., ‘Counting subgroups of non-Euclidean crystallographic groups’, Math. Scand. 84 (1999) 2339.
9Kerber, A. and Wegner, B., ‘Gleichungen in endlichen Gruppen’, Arch. Math. 351 (1980) 252262.
10Kwak, J. H. and Lee, J., ‘Isomorphism classes of graph bundles’, Canad. J. Math. XLII (1990) 747761.
11Kwak, J.H. and Lee, J., ‘Enumeration of connected graph coverings’, J. Graph Theory 23 (1996) 105109.
12Kwak, J.H. and Lee, J., ‘Distribution of branched -coverings of surfaces’, Discrete Math. 183 (1998) 193212.
13Kwak, J.H., Chun, J. and Lee, J., ‘Enumeration of regular graph coverings having finite abelian covering transformation groups’, SIAMJ. Discrete Math. 11 (1998) 273285.
14Kwak, J.H., Kim, S. and Lee, J., ‘Distribution of regular branched prime-fold coverings of surfaces’, Discrete Math. 156 (1996) 141170.
15Liskovets, V., ‘Towards the enumeration of subgroups of the free group’, Dokl. Akad. Nauk BSSR 15 (1971) 69 (in Russian).
16Mednykh, A.D., ‘Determination of the number of nonequivalent coverings over a compact Riemann surface’, Soviet Math. Dokl. 19 (1978 318320.
17Mednykh, A.D., ‘On unramified coverings of compact Riemann surfaces’, Soviet Math. Dokl. 20 (1979) 8588.
18Mednykh, A.D. and Pozdnyakova, G.G., ‘Number of nonequivalent coverings over a nonorientable compact surface’, Siber. Math. J. 27 (1986) 99106.
19Stahl, S., ‘Generalized embedding schemes’, J. Graph Theory 2 (1978) 4152.
20White, A.T., Graphs, groups and surfaces (North-Holland, N. York, 1984).
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Enumerating Branched Surface Coverings from Unbranched Ones

  • Jin Ho Kwak (a1), Jaeun Lee (a2) and Alexander Mednykh (a3)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed