Abstract
LetG,HandEbe subgroups of a finite nilpotent permutation group of degreen. We describe the theory and implementation of an algorithm to compute the normalizerNG(H) in time polynomial inn, and we give a modified algorithm to determine whetherHandEare conjugate underGand, if so, to find a conjugating element ofG. Other algorithms produce the intersectionG∩Hand the centralizerCG(H). The underlying method uses the imprimitivity structure of 〈G,H〉 and an associated canonical chief series to reduce computation to linear operations. Implementations in GAP and Magma are practical for degrees large enough to present difficulties for general-purpose methods.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
