2000 character limit reached
Gelfand pairs involving the wreath product of finite abelian groups with symmetric groups (2004.05900v1)
Published 13 Apr 2020 in math.CO, math.GR, and math.RT
Abstract: It is well known that the pair $(\mathcal{S}n,\mathcal{S}{n-1})$ is a Gelfand pair where $\mathcal{S}n$ is the symmetric group on $n$ elements. In this paper, we prove that if $G$ is a finite group then $(G\wr \mathcal{S}_n, G\wr \mathcal{S}{n-1}),$ where $G\wr \mathcal{S}_n$ is the wreath product of $G$ by $\mathcal{S}_n,$ is a Gelfand pair if and only if $G$ is abelian.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.