Search algorithm of the number of unfixed points of permutations from Sylow 2-subgroups Syl₂(S₂^n) of symmetric groups S₂^n.

DOI10.18523/2617-70804202134-40MaRDI QIDQ6568615FDOQ6568615

Authors: V. A. Olshevska 

Publication date: 8 July 2024

Published in: Mogylyans'kyĭ Matematychnyĭ Zhurnal (Search for Journal in Brave)

Recommendations

• Permutation codes over Sylow 2-subgroups \(\mathrm{Syl}_2(S_{2^n})\) of symmetric groups \(S_{2^n}\)
• scientific article; zbMATH DE number 4134288
• scientific article; zbMATH DE number 2230878
• Computing in permutation and matrix groups. III: Sylow subgroups
• scientific article; zbMATH DE number 975405

zbMATH Keywords

algorithmcomplexitySylow subgroupssymmetric groupsunfixed point

Mathematics Subject Classification ID

Symmetric groups (20B30) Subgroups of symmetric groups (20B35) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Other types of codes (94B60)

This page was built for publication: 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}\).

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