Normal subgroups and \(p\)-regular \(G\)-class sizes. (Q657953)

From MaRDI portal
Revision as of 18:29, 3 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Normal subgroups and \(p\)-regular \(G\)-class sizes.
scientific article

    Statements

    Normal subgroups and \(p\)-regular \(G\)-class sizes. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 January 2012
    0 references
    In the paper under review, the authors study finite \(p\)-soluble groups with a normal subgroup \(N\) in which the \(p\)-regular elements have exactly two \(G\)-conjugacy class sizes, \(1\) and \(m\), say. They prove in Theorem~A that in this case \(N\) possesses nilpotent \(p\)-complements and give further information about the structure of the \(p\)-complements: if \(H\) is a \(p\)-complement of \(N\), then either \(H\) is Abelian or \(H\) is a product of a \(q\)-group for some prime \(q\neq p\) and a central subgroup of~\(G\). In order to prove the nilpotency of the \(p\)-complements of \(N\), they use the classification of \textit{H. Heineken} [Math.\ Proc.\ R. Ir.\ Acad.\ 106A, No. 2, 191-198 (2006; Zbl 1146.20032)] of non-Abelian simple CP-groups, that is, groups in which every element has prime power order. As a corollary, it is obtained that if \(N\) is a normal subgroup of a finite group \(G\) such that the size of any \(G\)-conjugacy class contained in \(N\) is \(1\) or \(m\), then \(N\) is nilpotent.
    0 references
    finite \(p\)-soluble groups
    0 references
    finite groups
    0 references
    conjugacy class sizes
    0 references
    \(p\)-regular elements
    0 references
    numbers of conjugates
    0 references
    nilpotence
    0 references
    solvability
    0 references
    conjugacy classes
    0 references
    nilpotent \(p\)-complements
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references