scientific article; zbMATH DE number 3871623

From MaRDI portal
Publication:3338422





[For the entire collection see Zbl 0536.00004.] Fifteen years ago C. Sims introduced a new approach to computations in permutation groups. His approach is based on reduction of computations in the whole group to computations associated with a chain of stabilizers. After him some other authors tried to do this for abstract groups. In the paper under review this approach is applied to soluble groups and instead of a chain of stabilizers a composition series is considered. This method enables to reduce the computing requirements about logarithmically. The authors describe based on this method algorithms for the computation of normalizers, centralizers, Sylow subgroups, conjugacy classes in soluble groups, maximal abelian subgroups and intersections of subgroups in p- groups and some other algorithms. At the end of the paper there is a brief description of the program system SOGOS (\underbar{so}luble \underbar{g}roups \underbar{o}perating \underbar{s}ystem) which includes these algorithms. The system is written in FORTRAN 4 and consists now of about 40000 operators. To demonstrate the possibilities of SOGOS the authors give some examples of its use.




Cited in
(46)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3338422)