This analysis shows that wreath products address the non-coprime k (GV) problem in semiprimitive groups, indicating a solution for related queries.
Let G = X H be the wreath product of a nontrivial finite group X with k conjugacy classes and a transitive permutation group H of degree n acting on the set of n direct factors of X n . If H is semiprimitive, then k(G) ≤ kⁿ for every sufficiently large n or k . This result solves a case of the non-coprime k ( GV ) problem and provides an affirmative answer to a question of Garzoni and Gill for semiprimitive permutation groups. The proof does not require the classification of finite simple groups.
No takes yet. Share an insight, caveat, or question.
Hung et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: