Abstract
Given a group G and n ≥ 0 , let W(G, n) be the associated iterated wreath product—unrestricted when G is infinite—viewed as a permutation group on Gn . We prove that the normalizer of W(G, n) in the symmetric group S ( G n ) is equal to M n ⋉ W ( G , n ) , where Mn is isomorphic to Aut ( G ) n . The action of Aut ( G ) n on W(G, n) is recursively described. Communicated by Mark Lewis
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.
