On the normalizer of an iterated wreath product
Fernando Szechtman
Abstract
Fernando Szechtman
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(Gn) is equal to Mn⋉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
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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(Gn) is equal to Mn⋉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
Key concepts: Wreath product, Centralizer and normalizer, Mathematics, Combinatorics, Permutation group, Iterated function, Symmetric group, Mathematics Subject Classification