Generating sets of affine groups of low genus
From MaRDI portal
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.
Recommendations
Cited in
(8)- Genus \(g\) groups of diagonal type
- Connected components of affine primitive permutation groups
- Primitive monodromy groups of genus at most two
- Groups generated by affine perspectivities
- Hurwitz components of groups with socle PSL(3, q)
- A GAP Package for Braid Orbit Computation and Applications
- Weighted trees with primitive edge rotation groups
- Primitive monodromy groups of rational functions with one multiple pole
This page was built for publication: Generating sets of affine groups of low genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500052)