SearcharxivSearch

arXiv · 2001.02295

Connected Components of Affine Primitive Permutation Groups

Abstract

For a finite group $G$, the Hurwitz space $\mathcal{H}^{in}_{r,g}(G)$ is the space of genus $g$ covers of the Riemann sphere with $r$ branch points and the monodromy group $G$. In this paper, we give a complete list of primitive genus one systems of affine type. That is, we assume that $G$ is a primitive group of affine type. Under this assumption we determine the braid orbits on the suitable Nielsen classes, which is equivalent to finding connected components in $\mathcal{H}^{in}_{r,1}(G)$. Furthermore, we give a new algorithm for computing large braid orbits on Nielsen classes. This algorithm utilizes a correspondence between the components of $\mathcal{H}^{in}_{r,1}(G)$ and $\mathcal{H}^{in}_{r,1}(M)$, where $M$ is the point stabilizer in $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Haval M. Mohammed Salih. 2019-12-24. Connected Components of Affine Primitive Permutation Groups. https://arxiv.org/abs/2001.02295

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR