1969
DOI: 10.1007/bf02992891
|View full text |Cite
|
Sign up to set email alerts
|

Endliche Gruppen mit vielen modularen Untergruppen

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

1974
1974
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(7 citation statements)
references
References 6 publications
0
7
0
Order By: Relevance
“…Therefore, every (n−1)-maximal subgroup of E is either modular or S-quasinormal in E by Lemmas 2.2(4) and 2.3 (1). Thus, by the isomorphism G/N ≃ E, Lemma 2.2(5) implies that every (n − 1)-maximal subgroup of G/N is either modular or S-quasinormal in G/N , and also we have n − 1 ≤ |π(G/N )| + r. The lemma is proved.…”
Section: Proof Of Theorem Amentioning
confidence: 88%
See 3 more Smart Citations
“…Therefore, every (n−1)-maximal subgroup of E is either modular or S-quasinormal in E by Lemmas 2.2(4) and 2.3 (1). Thus, by the isomorphism G/N ≃ E, Lemma 2.2(5) implies that every (n − 1)-maximal subgroup of G/N is either modular or S-quasinormal in G/N , and also we have n − 1 ≤ |π(G/N )| + r. The lemma is proved.…”
Section: Proof Of Theorem Amentioning
confidence: 88%
“…Take a prime divisor q of the order of G distinct from p. Take a Hall q ′ -subgroup E of G, and let E ≤ W where W is a maximal subgroup of G. Then N ≤ E and since G is soluble, Lemmas 2.2(4) and 2.3 (1) imply that the hypothesis holds for W . Consequently, the choice of G implies that for some prime t dividing |E| a Sylow t-subgroup Q of E is normal in E. Proof.…”
Section: Proof Of Theorem Amentioning
confidence: 99%
See 2 more Smart Citations
“…We propose to study here the structure of them over any field of characteristic zero. The corresponding problem for groups was considered by Schmidt [6] and Venzke [11] THEOREM (Schmidt). A finite group G is an M(l)-group if and only if G is supersolvable and for each complemented chief factor H/K of G, |Aut G (H/K)| is prime (or 1).…”
Section: Introductionmentioning
confidence: 99%