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.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The original version of the article was published in Central European Journal of Mathematics, 2011, 9(4), 915–921, DOI: 10.2478/s11533-011-0029-8. Unfortunately, the original version of this article contains a mistake: Lemma 2.1 (2) is not true. We correct Lemma 2.2 (2) and Theorem 1.1 in our paper where this lemma was used.
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ć.