Finding Sylow normalizers in polynomial time

DOI10.1016/0196-6774(90)90009-4MaRDI QIDQ3356508zbMATH OpenOpenAlexWikidataFDO

Authors William M. Kantor

Publication date 1990

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.3342

zbMATH Keywords

Hall \(\pi\)-subgroupsnormalizerpolynomial-time algorithmssimple factorsSylow p-subgroupssymmetric group

Mathematics Subject Classification ID

Subgroups of symmetric groups (20B35) Sylow subgroups, Sylow properties, (pi)-groups, (pi)-structure (20D20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Sylow's theorem in polynomial time
• Polynomial-time versions of Sylow's theorem
• Polynomial-time algorithms for finding elements of prime order and sylow subgroups
• scientific article; zbMATH DE number 96386
• Primitive normalisers in quasipolynomial time

Cited in

(7)

• Sylow's theorem in polynomial time
• Primitive normalisers in quasipolynomial time
• Polynomial-time versions of Sylow's theorem
• Computing Hall subgroups of finite groups.
• Polynomial-time normalizers
• Formations of finite groups in polynomial time: \(\mathfrak{F}\)-residuals and \(\mathfrak{F}\)-subnormality
• Computing σ -properties of finite groups in polynomial time

This page was built for publication: Finding Sylow normalizers in polynomial time

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