Search arXivSearch

arXiv · 1407.5937

Factorizing a Finite Group into Conjugates of a Subgroup

Abstract

For every non-nilpotent finite group $G$, there exists at least one proper subgroup $M$ such that $G$ is the setwise product of a finite number of conjugates of $M$. We define $\gamma_{\text{cp}}\left( G\right) $ to be the smallest number $k$ such that $G$ is a product, in some order, of $k$ pairwise conjugated proper subgroups of $G$. We prove that if $G$ is non-solvable then $\gamma_{\text{cp}}\left( G\right) \leq36$ while if $G$ is solvable then $\gamma_{\text{cp}}\left( G\right) $ can attain any integer value bigger than $2$, while, on the other hand, $\gamma_{\text{cp}}\left( G\right) \leq4\log_{2}\left\vert G\right\vert $.

Explore related subjects

Keep this discovery

BibTeXRIS

Dan Levy, Martino Garonzi. 2014-07-22. Factorizing a Finite Group into Conjugates of a Subgroup. https://arxiv.org/abs/1407.5937

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