SearcharxivSearch

arXiv · 1203.0138

Orientable regular maps with Euler characteristic divisible by few primes

Abstract

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $χ$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$ of $G$ is a finite group of Lie type with rank $n\leq x$. This result is proved using new results connecting the prime graph of $T$ to the integer $x$. We then study the particular cases $x=1$ and $x=2$. We give a general structure statement for $(2,m,n)$-groups which have Euler characteristic a prime power, and we construct an infinite family of these objects. We also give a complete classification of those $(2,m,n)$-groups which are almost simple and for which the Euler characteristic is a prime power (there are four such). Finally we study those $(2,m,n)$-groups which are almost simple and for which the Euler characteristic is a product of two prime powers. All such groups which are not isomorphic to $PSL_2(q)$ or $PGL_2(q)$ are completely classified.

Explore related subjects

Keep this discovery

BibTeXRIS

Nick Gill. 2012-05-17. Orientable regular maps with Euler characteristic divisible by few primes. https://doi.org/10.1112/jlms%2Fjdt010

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