๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of Finite Groups

โœ Scribed by H.U. Besche; B. Eick

Book ID
102976563
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
533 KB
Volume
27
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

We introduce three practical algorithms to construct certain finite groups up to isomorphism. The first one can be used to construct all soluble groups of a given order. This method can be restricted to compute the soluble groups with certain properties such as nilpotent, non-nilpotent or supersoluble groups. The second algorithm can be used to determine the groups of order p n โ€ข q with a normal Sylow subgroup for distinct primes p and q. The third method is a general method to construct finite groups which we use to compute insoluble groups.

๐Ÿ“œ SIMILAR VOLUMES

The computer construction of matrix repr
The computer construction of matrix representationsof finite groups over finite fields
โœ R.A. Parker; R.A. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 517 KB

Given an abstract group G it is important to be able to find explicit generators for a concrete group isomorphic to G, in order to perform calculations with the group. In this paper we describe a method of using the "Meat-axe" to construct explicit matrix generators for a given group.

Constructing matrix representations of f
Constructing matrix representations of finitely presented groups
โœ S.A. Linton ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 777 KB

The Todd-Coxeter coset enumeration algorithm is one of the most important tools of computational group theory. It may be viewed as a means of constructing permutation representations of finitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix repres