SearcharxivSearch

arXiv · 1204.4271

Finitely Generated Groups $G$ such that $G/Z(G) \simeq C_p \times C_p$

Abstract

Finite groups $G$ such that $G/Z(G) \simeq C_2 \times C_2$ where $C_2$ denotes a cyclic group of order 2 and $Z(G)$ is the center of $G$ were studied in \cite{casofinito} and were used to classify finite loops with alternative loop algebras. In this paper we extend this result to finitely generated groups such that $G/Z(G) \simeq C_p \times C_p$ where $C_p$ denotes a cyclic group of prime order $p$ and provide an explicit description of all such groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Mariana Cornelissen, César Polcino Milies. 2012-04-19. Finitely Generated Groups $G$ such that $G/Z(G) \simeq C_p \times C_p$. https://doi.org/10.1080/00927872.2012.727050

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