Search arXivSearch

arXiv · math/0401423

Capable groups of prime exponent and class two

Abstract

A group is called capable if it is a central factor group. We consider the capability of finite groups of class two and exponent $p$, $p$ an odd prime. We restate the problem of capability as a problem about linear transformations, which may be checked explicitly for any specific instance of the problem. We use this restatement to derive some known results, and prove new ones. Among them, we reduce the general problem to an oft-considered special case, and prove that a 3-generated group of class 2 and exponent $p$ is either cyclic or capable.

Explore related subjects

Keep this discovery

BibTeXRIS

Arturo Magidin. 2004-01-29. Capable groups of prime exponent and class two. https://arxiv.org/abs/math/0401423

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