SearcharxivSearch

arXiv · 1501.05678

Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent

Abstract

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of finite simple groups of Lie type to give a unified self-contained proof that every such group is a product of four or three unipotent Sylow subgroups. Then we derive an upper bound on the minimal length of a solvable conjugate factorization of a general finite group. Finally, using conjugate factorizations of a general finite solvable group by any of its Carter subgroups, we obtain an upper bound on the minimal length of a nilpotent conjugate factorization of a general finite group.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Martino Garonzi, Dan Levy, Attila Maróti, Iulian I. Simion. 2015-03-06. Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent. https://arxiv.org/abs/1501.05678

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