Active sums of groups.
Addendum and corrigendum to «Automorfismi che fissano i centralizzanti di un gruppo»
Addendum to : “Prime graph components of finite almost simple groups” [Rend. Sem. Mat. Univ. Padova 102 (1999), 1–22]
Adjoining conjugating elements to finite groups
Affinitäten endlicher Gruppen.
Algebre di Lie graduate in caratteristica due
Algorithms for permutability in finite groups
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.
All geometries of the Mathieu group based on maximal subgroups.
Alternating group coverings of the affine line for characteristic greater than two.
An algorithm for the word problem in extensions and the dependence of its complexity on the group representation
An Amalgam Related to M_11 and SP_4(3)
An application of Burnside rings in elementary finite group theory.
An axiomatic approach for the Hajós theorem.
An elementary proof that finite groups are projectively torsion-free
An elementary study of groups whose order is a product of two primes.
An example in the theory of fitting classes
An Example in the Theory of Normal Fitting Classes.
An existence lemma for groups generated by 3-transpositions.
An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups.
Analoga des Fundamentalsatzes der projektiven Geometrie in der Gruppentheorie. II