Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups \(Syl_2(S_{2^n})\) of symmetric groups \(S_{2^n}\). (Q6568615)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups Syl₂(S₂^n) of symmetric groups S₂^n. |
scientific article; zbMATH DE number 7877831
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups \(Syl_2(S_{2^n})\) of symmetric groups \(S_{2^n}\). |
scientific article; zbMATH DE number 7877831 |
Statements
Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups \(Syl_2(S_{2^n})\) of symmetric groups \(S_{2^n}\). (English)
0 references
8 July 2024
0 references
unfixed point
0 references
symmetric groups
0 references
Sylow subgroups
0 references
algorithm
0 references
complexity
0 references
0.8678359389305115
0 references
0.746894121170044
0 references
