Classical curves via one-vertex maps (Q357840)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 6198224
Language Label Description Also known as
default for all languages
No label defined
    English
    Classical curves via one-vertex maps
    scientific article; zbMATH DE number 6198224

      Statements

      Classical curves via one-vertex maps (English)
      0 references
      13 August 2013
      0 references
      A \textit{one-vertex map} is a combinatorial structure that corresponds to a branched cover \(Y \to \mathbb{P}^1_{\mathbb{C}}\) of Riemann surfaces of degree \(2k\), unbranched outside \(\{0, 1, \infty\}\), such that the cover is totally ramified above \(0\) and each point above \(1\) is ramified of index \(2\). Such a map is called \textit{regular} if it is Galois, and it is called \textit{strictly edge transitive} if Aut\((Y/\mathbb{P}^1)\) has order \(k\), transitively permuting the points above \(1\). This paper has two main results. The first is to given an explicit count of all one-vertex maps, up to a certain equivalence relation. The second is to show that, for several families of Riemann surfaces (complex curves), each member of each family can be realized as the ``upstairs'' curve of a regular or strictly transitive one-vertex map. These families include the Wiman curves, the Accola-Maclachan curves, the Kulkarni curves, and the Klein quartic. The curve families are given by explicit equations, and are interesting because they represent curves with large automorphisms groups relative to their genera.
      0 references
      0 references
      Riemann surface
      0 references
      automorphism group
      0 references
      curve
      0 references
      dessin d'enfant
      0 references
      map
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers