English

Kronecker classes, normal coverings and chief factors of groups

Group Theory 2026-01-14 v1 Combinatorics

Abstract

For a group GG, a subgroup UGU \leq G and a group Inn(G)AAut(G)\mathrm{Inn}(G) \leq A \leq \mathrm{Aut}(G), we say that UU is an AA-covering group of GG if G=aAUaG = \bigcup_{a\in A}U^a. A theorem of Jordan (1872) implies that if GG is a finite group, A=Inn(G)A = \mathrm{Inn}(G) and UU is an AA-covering group of GG, then U=GU = G. Motivated by a question concerning Kronecker classes of field extensions, Neumann and Praeger (1988) conjectured that, more generally, there is an integer function ff such that if GG is a finite group and UU is an AA-covering subgroup of GG, then G:Uf(A:Inn(G))|G:U| \leq f(|A:\mathrm{Inn}(G)|). A key piece of evidence for this conjecture is a theorem of Praeger (1994), which asserts that there is a two-variable integer function gg such that if GG is a finite group and UU is an AA-covering subgroup of GG, then G:Ug(A:Inn(G),c)|G:U|\leq g(|A:\mathrm{Inn}(G)|,c) where cc is the number of AA-chief factors of~GG. Unfortunately, the proof of this result contains an error. In this paper, using a different argument, we give a correct proof of this theorem.

Keywords

Cite

@article{arxiv.2410.02569,
  title  = {Kronecker classes, normal coverings and chief factors of groups},
  author = {Marco Fusari and Scott Harper and Pablo Spiga},
  journal= {arXiv preprint arXiv:2410.02569},
  year   = {2026}
}

Comments

6 pages