Answers are grounded in this paper and cite their sources.
We consider factorizations of a finite group G into conjugate subgroups,=A^x₁\⋯ A^xₖ for A\≤ G and x₁,\… ,xₖ\∈ G, A is nilpotent or solvable. First we exploit the split $BN$-pair of finite simple groups of Lie type to give a unified self-contained that every such group is a product of four or three unipotent Sylow. Then we derive an upper bound on the minimal length of a solvable factorization of a general finite group. Finally, using conjugate of a general finite solvable group by any of its Carter, we obtain an upper bound on the minimal length of a nilpotent factorization of a general finite group.
No takes yet. Share an insight, caveat, or question.
Garonzi et al. (2015) studied this question.