Generating sets of Affine groups of low genus

Generating sets of Affine groups of low genus

We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy group is a primitive affine permutation group.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2011-08
Hauptverfasser: Magaard, Kay, Shpectorov, Sergey, Wang, Gehao
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Mathematics - Group Theory
Permutations
Riemann manifold
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy group is a primitive affine permutation group.
ISSN:2331-8422
DOI:10.48550/arxiv.1108.4833