SearcharxivSearch

arXiv · 1604.06031

Beauville structures in $p$-central quotients

Abstract

We prove a conjecture of Boston that if $p\geq 5$, all $p$-central quotients of the free group on two generators and of the free product of two cyclic groups of order $p$ are Beauville groups. In the case of the free product, we also determine Beauville structures in $p$-central quotients when $p=3$. As a consequence, we give an explicit infinite family of Beauville $3$-groups, which is different from the only one that was known up to date.

Explore related subjects

Keep this discovery

BibTeXRIS

Şükran Gül. 2016-04-20. Beauville structures in $p$-central quotients. https://arxiv.org/abs/1604.06031

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