Algorithms for permutability in finite groups. (Q2440508): Difference between revisions

The authors show how to set up algorithms to decide whether certain permutability properties for groups or certain subgroups of a group are satisfied. Properties of subgroups to be tested are permutability and S-permutability, the group classes considered are Dedekind, Iwasawa, T-, PT-, and PST-groups. A background on the results needed is given as well as some remarks on expense and efficiency of the programs. A GAP package for these programs is offered.