Algorithms for permutability in finite groups. (Q2440508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6271122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for permutability in finite groups. |
scientific article; zbMATH DE number 6271122 |
Statements
Algorithms for permutability in finite groups. (English)
0 references
19 March 2014
0 references
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.
0 references
finite groups
0 references
permutability properties
0 references
algorithms
0 references
permutable subgroups
0 references
Sylow-permutable subgroups
0 references
finite T-groups
0 references
PT-groups
0 references
PST-groups
0 references
0 references
0.9553407
0 references
0.9414761
0 references
0 references
0.9147248
0 references
