Search arXivSearch

arXiv · 1405.7541

Strongly Real Beauville Groups

Abstract

A strongly real Beauville group is a Beauville group that defines a real Beauville surface. Here we discuss efforts to find examples of these groups, emphasising on the one extreme finite simple groups and on the other abelian and nilpotent groups. We will also discuss the case of characteristically simple groups and almost simple groups. \emph{En route} we shall discuss several questions, open problems and conjectures as well as giving several new examples of infinite families of strongly real Beauville groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Ben Fairbairn. 2014-05-29. Strongly Real Beauville Groups. https://arxiv.org/abs/1405.7541

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