Search arXivSearch

arXiv · 1908.05456

Generating pairs of projective special linear groups that fail to lift

Abstract

The following problem was originally posed by B.H. Neumann and H. Neumann. Suppose that a group $G$ can be generated by $n$ elements and that $H$ is a homomorphic image of $G$. Does there exist, for every generating $n$-tuple $(h_1,\ldots, h_n)$ of $H$, a homomorphism $\vartheta \colon G \to H$ and a generating $n$-tuple $(g_1,\ldots,g_n)$ of $G$ such that $(g_1^\vartheta,\ldots,g_n^\vartheta) = (h_1,\ldots,h_n)$? M.J. Dunwoody gave a negative answer to this question, by means of a carefully engineered construction of an explicit pair of soluble groups. Via a new approach we produce, for $n = 2$, infinitely many pairs of groups $(G,H)$ that are negative examples to the Neumanns' problem. These new examples are easily described: $G$ is a free product of two suitable finite cyclic groups, such as $C_2 \ast C_3$, and $H$ is a suitable finite projective special linear group, such as $\mathrm{PSL}(2,p)$ for a prime $p \ge 5$. A small modification yields the first negative examples $(G,H)$ with $H$ infinite.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan Boschheidgen, Benjamin Klopsch, Anitha Thillaisundaram. 2019-08-15. Generating pairs of projective special linear groups that fail to lift. https://arxiv.org/abs/1908.05456

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