𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Constructing a Short Defining Set of Relations for a Finite Group

✍ Scribed by Volker Gebhardt


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
142 KB
Volume
233
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

✦ Synopsis


An algorithm for the construction of a defining set of relations w.r.t. a given set of generators of a finite group G is presented. Compared with previously known methods it yields fewer relations and is better suited for iterated application to large groups. These improvements are achieved by considering the action of some subgroup H < G on the vertices of the Cayley graph of G w.r.t. the subgroup H.


πŸ“œ SIMILAR VOLUMES


A complete set of invariants for finite
✍ Moshe Roitman πŸ“‚ Article πŸ“… 1981 πŸ› Elsevier Science 🌐 English βš– 448 KB

For a finite group G and a set Z c ( 1,2,..., n) let e,h 1) = C h(g) 0 et(g) 63 a.. 0 e,(g), SEG where G?) = g if i E I, a?) = 1 if i&Z. We prove, among other results, that the positive integers tr(e,(n, I, ) + ... + e,(n, I,))': n, r, k) 1, Zjz { l,..., n), 1 < II,1 < 3 for 1 1 and a set Z s { 1,2

On the Construction of the Finite Simple
✍ Gerhard O. Michler πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 193 KB

## dedicated to helmut wielandt on the occasion of his 90th birthday Let H be a finite group having center Z H of even order. By the classical Brauer-Fowler theorem there can be only finitely many non-isomorphic simple groups G which contain a 2-central involution t for which C G t ∼ = H. In this