On the normalizer of an iterated wreath product
Fernando Szechtman
Abstract
Open-access reader
Fernando Szechtman
Abstract
Open-access reader
Given a group $G$ and $n\geq 0$, let $W(G,n)$ be the associated iterated wreath product -- unrestricted when $G$ is infinite -- viewed as a permutation group on $G^n$. We prove that the normalizer of $W(G,n)$ in the symmetric group $S(G^n)$ is equal to $M_n\ltimes W(G,n)$, where $M_n$ is isomorphic to~$\mathrm{Aut}(G)^n$. The action of $\mathrm{Aut}(G)^n$ on $W(G,n)$ is recursively described.
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\geq 0$, let $W(G,n)$ be the associated iterated wreath product -- unrestricted when $G$ is infinite -- viewed as a permutation group on $G^n$. We prove that the normalizer of $W(G,n)$ in the symmetric group $S(G^n)$ is equal to $M_n\ltimes W(G,n)$, where $M_n$ is isomorphic to~$\mathrm{Aut}(G)^n$. The action of $\mathrm{Aut}(G)^n$ on $W(G,n)$ is recursively described.
Key concepts: Wreath product, Centralizer and normalizer, Iterated function, Combinatorics, Permutation group, Mathematics, Group (periodic table), Product (mathematics)