Generating sets of Affine groups of low genus
classification
🧮 math.GR
keywords
affinefamiliesgenusgroupalgorithmapplicationbraidclasses
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.