Displaying similar documents to “On minimal logarithmic signatures of finite groups.”

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.

Pronormal and subnormal subgroups and permutability

James Beidleman, Hermann Heineken (2003)

Bollettino dell'Unione Matematica Italiana

Similarity:

We describe the finite groups satisfying one of the following conditions: all maximal subgroups permute with all subnormal subgroups, (2) all maximal subgroups and all Sylow p -subgroups for p < 7 permute with all subnormal subgroups.

Finite groups with primitive Sylow normalizers

A. D&amp;amp;#039;Aniello, C. De Vivo, G. Giordano (2002)

Bollettino dell'Unione Matematica Italiana

Similarity:

We prove that are primitive the finite groups whose normalizers of the Sylow subgroups are primitive. We classify the groups of such class, denoted by N ⁢ P , and we study the Schunck classes whose boundary is contained in N ⁢ P . We give also necessary and sufficient conditions in order that the projectors be subnormally embedded.

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.