Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Permutable subgroup
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Groups with all subgroups permutable or of finite rank

100%
EN
In this paper we investigate the structure of X-groups in which every subgroup is permutable or of finite rank. We show that every subgroup of such a group is permutable.
2
Content available remote

Algorithms for permutability in finite groups

63%
EN
In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.
3
Content available remote

Groups whose all subgroups are ascendant or self-normalizing

63%
EN
This paper studies groups G whose all subgroups are either ascendant or self-normalizing. We characterize the structure of such G in case they are locally finite. If G is a hyperabelian group and has the property, we show that every subgroup of G is in fact ascendant provided G is locally nilpotent or non-periodic. We also restrict our study replacing ascendant subgroups by permutable subgroups, which of course are ascendant [Stonehewer S.E., Permutable subgroups of infinite groups, Math. Z., 1972, 125(1), 1–16].
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.