On minimal logarithmic signatures of finite groups.
Lempken, Wolfgang, van Trung, Tran (2005)
Experimental Mathematics
Similarity:
Lempken, Wolfgang, van Trung, Tran (2005)
Experimental Mathematics
Similarity:
Kondrat'ev, A.S., Guo, Wenbin (2009)
Sibirskij Matematicheskij Zhurnal
Similarity:
Chigira, Naoki, Iiyori, Nobuo, Yamaki, Hiroyoshi (1998)
Electronic Research Announcements of the American Mathematical Society [electronic only]
Similarity:
John G. Thompson (1966-1968)
Séminaire Bourbaki
Similarity:
A. D'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 , and we study the Schunck classes whose boundary is contained in . We give also necessary and sufficient conditions in order that the projectors be subnormally embedded.
Carlo Casolo, Silvio Dolfi (1996)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Zvonimir Janko (1976-1977)
Séminaire Bourbaki
Similarity:
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.
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.
Miao, Long, Qian, Guohua (2009)
Sibirskij Matematicheskij Zhurnal
Similarity: