On mutually permutable products of finite groups. (Q5920329): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the supersolvability of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Condition for the Supersolvability of Finite Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for a finite group to be supersolvable. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of finite groups and their properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PRODUCTS OF FINITE SUPERSOLUBLE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Products of finite groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON SOLVABLE GROUPS OF FINITE ORDER / rank
 
Normal rank
Property / cites work
 
Property / cites work: On supersolvability of finite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Mutually<i>M</i>-Permutable Products of Finite Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das Produkt von paarweise vertauschbaren zyklischen Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949183 / rank
 
Normal rank

Latest revision as of 12:21, 8 July 2024

scientific article; zbMATH DE number 6292160
Language Label Description Also known as
English
On mutually permutable products of finite groups.
scientific article; zbMATH DE number 6292160

    Statements

    On mutually permutable products of finite groups. (English)
    0 references
    0 references
    0 references
    5 May 2014
    0 references
    A finite group \(G\) is the product of its pairwise permutable subgroups \(G_1,\ldots,G_n\) if \(G=G_1G_2\cdots G_n\) and \(G_iG_j=G_jG_i\) for all \(i\neq j\). The subgroups appearing in this decomposition of \(G\) are called the factors of the decomposition. A widely examined question is that if \(G\) is a product of some of its permutable subgroups then what can be said about \(G\) if some properties of the factors are known. As a generalization of Burnside's famous \(p^\alpha q^\beta\) theorem, it was partly proved by \textit{H. Wielandt} [Math. Z. 55, 1-7 (1951; Zbl 0043.25803); Ill. J. Math. 2, No. 4B, 611-618 (1958; Zbl 0084.02904)] and completed by \textit{O. H. Kegel} [Arch. Math. 12, 90-93 (1961; Zbl 0099.01401)] that if \(G\) is a product of some of its pairwise permutable nilpotent subgroups, then \(G\) is solvable. This theorem, which is now called the Kegel-Wielandt theorem, was a motivation for a number of results about products of pairwise permutable subgroups of a group. The authors of this paper use the concept of mutually \(m\)-permutable products introduced by \textit{A. Ballester-Bolinches, J. Cossey and M. C. Pedraza-Aguilera} [Commun. Algebra 29, No. 7, 3145-3152 (2001; Zbl 0985.20013)], which says that \(G=G_1G_2\) is a mutually \(m\)-permutable product of the subgroups \(G_1\) and \(G_2\) if both of them permute with every maximal subgroup of the other one. Among other results, the following is proved. Let \(G=G_1G_2\cdots G_n\) be the product of its pairwise permutable subgroups \(G_1,\ldots,G_n\) such that \((|G_iG_j:G_i|,|G_iG_j:G_j|)=1\) and \(G_iG_j\) is a mutually \(m\)-permutable product for all \(i\neq j\). If all \(G_i\) are nilpotent, then \(G\) is supersolvable.
    0 references
    mutually permutable products
    0 references
    products of finite groups
    0 references
    mutually \(m\)-permutable products
    0 references
    supersolvable groups
    0 references
    nilpotent groups
    0 references
    pairwise permutable subgroups
    0 references
    Kegel-Wielandt theorem
    0 references
    maximal subgroups
    0 references
    Sylow subgroups
    0 references
    supersolvability
    0 references

    Identifiers

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