On generalised FC-groups in which normality is a transitive relation. (Q2800020)

From MaRDI portal





scientific article; zbMATH DE number 6568873
Language Label Description Also known as
English
On generalised FC-groups in which normality is a transitive relation.
scientific article; zbMATH DE number 6568873

    Statements

    0 references
    0 references
    14 April 2016
    0 references
    T-groups
    0 references
    generalised FC-groups
    0 references
    pronormal subgroups
    0 references
    maximal subgroups
    0 references
    transitive normality
    0 references
    On generalised FC-groups in which normality is a transitive relation. (English)
    0 references
    A group \(G\) is an FC-group, if all elements are contained in finite conjugacy classes. We call FC-groups \(\text{FC}^1\)-groups and define recursively \(\text{FC}^{n+1}\)-groups as groups all of whose elements \(x\) satisfy \(G/C_G(x)\in\text{FC}^n\). The set-theoretical union of all of these classes is the class of \(\text{FC}^*\)-groups. Denote by \(A_G(H)\) the intersection of all subgroups of \(G\) containing the subgroup \(H\) and call \(G\) an NNM-group if every non-normal subgroup of \(G\) is contained in a non-normal maximal subgroup of \(G\).NEWLINENEWLINE Results: If \(G\) is an \(\text{FC}^*\)-group with \(A_G(H)\) non-normal whenever \(H\) is non-normal in \(G\), then \(G\) is a T-group and NNM-group.NEWLINENEWLINE For \(\text{FC}^*\)-groups \(G\) the following are equivalent: (i) \(G\) is a soluble T-group, (ii) every subgroup of \(G\) is pronormal, (iii) every cyclic subgroup of \(G\) is pronormal, and \(G\) is then an FC-group.NEWLINENEWLINE For \(\text{FC}^*\)-groups \(G\) the following are equivalent: (i) \(G\) is a soluble T-group, (ii) all subgroups of \(G\) are NNM-groups. (Proposition 2.2, Theorem 2.3, Theorem 2.5). -- They are extensions of results by Kaplan and the second author.
    0 references
    0 references

    Identifiers

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