SearcharxivSearch

arXiv · 2404.14599

Rank type conditions on commutators in finite groups

Abstract

For a subgroup $S$ of a group $G$, let $I_G(S)$ denote the set of commutators $[g,s]=g^{-1}g^s$, where $g\in G$ and $s\in S$, so that $[G,S]$ is the subgroup generated by $I_G(S)$. We prove that if $G$ is a $p$-soluble finite group with a Sylow $p$-subgroup $P$ such that any subgroup generated by a subset of $I_G(P)$ is $r$-generated, then $[G,P]$ has $r$-bounded rank. We produce examples showing that such a result does not hold without the assumption of $p$-solubility. Instead, we prove that if a finite group $G$ has a Sylow $p$-subgroup $P$ such that (a) any subgroup generated by a subset of $I_G(P)$ is $r$-generated, and (b) for any $x\in I_G(P)$, any subgroup generated by a subset of $I_G(x)$ is $r$-generated, then $[G,P]$ has $r$-bounded rank. We also prove that if $G$ is a finite group such that for every prime $p$ dividing $|G|$ for any Sylow $p$-subgroup $P$, any subgroup generated by a subset of $I_G(P)$ can be generated by $r$ elements, then the derived subgroup $G'$ has $r$-bounded rank. As an important tool in the proofs, we prove the following result, which is also of independent interest: if a finite group $G$ admits a group of coprime automorphisms $A$ such that any subgroup generated by a subset of $I_G(A)$ is $r$-generated, then the rank of $[G,A]$ is $r$-bounded.

Explore related subjects

Keep this discovery

BibTeXRIS

Cristina Acciarri, Robert M. Guralnick, Evgeny Khukhro, Pavel Shumyatsky. 2024-04-22. Rank type conditions on commutators in finite groups. https://arxiv.org/abs/2404.14599

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