×

Some characterisations of soluble SST-groups. (English) Zbl 1346.20019

All groups in this review are understood to be finite. A subgroup \(H\) of a group \(G\) is said to be SS-permutable (or SS-quasinormal) in \(G\) if \(H\) has a supplement \(K\) in \(G\) such that \(H\) permutes with every Sylow subgroup of \(K\). A group \(G\) is an SST-group provided that SS-permutability is a transitive relation in \(G\).
The main aim of this paper is to present several characterizations of soluble SST-groups.

MSC:

20D40 Products of subgroups of abstract finite groups
20D10 Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks
20D20 Sylow subgroups, Sylow properties, \(\pi\)-groups, \(\pi\)-structure
Full Text: DOI

References:

[1] DOI: 10.1515/forum.2010.045 · Zbl 1205.20025 · doi:10.1515/forum.2010.045
[2] DOI: 10.1016/j.jalgebra.2007.12.001 · Zbl 1148.20013 · doi:10.1016/j.jalgebra.2007.12.001
[3] DOI: 10.1006/jabr.2001.9138 · Zbl 1010.20013 · doi:10.1006/jabr.2001.9138
[4] DOI: 10.1515/9783110220612 · doi:10.1515/9783110220612
[5] DOI: 10.1016/j.jalgebra.2009.01.007 · Zbl 1190.20015 · doi:10.1016/j.jalgebra.2009.01.007
[6] DOI: 10.1007/s10474-014-0398-0 · Zbl 1316.20021 · doi:10.1007/s10474-014-0398-0
[7] Chen Z. M., Southwest Normal Univ. Nat. Sci 12 (1) pp 1– (1987)
[8] DOI: 10.1515/9783110870138 · doi:10.1515/9783110870138
[9] DOI: 10.1007/978-3-642-64981-3 · Zbl 0217.07201 · doi:10.1007/978-3-642-64981-3
[10] DOI: 10.1016/j.jalgebra.2008.01.030 · Zbl 1152.20019 · doi:10.1016/j.jalgebra.2008.01.030
[11] Wang L., Int. J. Algebra 2 (1) pp 143– (2008)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.