Displaying similar documents to “Grouptheoretical investigations on computers”

Classification of finite groups with many minimal subgroups and with the number of conjugacy classes of G/S(G) equal to 8.

Antonio Vera López, Jesús María Arregi Lizarraga, Francisco José Vera López (1990)

Collectanea Mathematica

Similarity:

In this paper we classify all the finite groups satisfying r(G/S(G))=8 and ß(G)=r(G) - a(G) - 1, where r(G) is the number of conjugacy classes of G, ß(G) is the number of minimal normal subgroups of G, S(G) the socle of G and a(G) the number of conjugacy classes of G out of S(G). These results are a contribution to the general problem of the classification of the finite groups according to the number of conjugacy classes.

Algorithms for permutability in finite groups

Adolfo Ballester-Bolinches, Enric Cosme-Llópez, Ramón Esteban-Romero (2013)

Open Mathematics

Similarity:

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.