2000 character limit reached
On the symmetric Gelfand pair $(\mathcal{H}_n\times \mathcal{H}_{n-1},diag (\mathcal{H}_{n-1}))$
Published 11 Dec 2019 in math.CO and math.RT | (1912.05294v1)
Abstract: We show that the $\mathcal{H}{n-1}$-conjugacy classes of $\mathcal{H}_n,$ where $\mathcal{H}_n$ is the hyperoctahedral group on $2n$ elements, are indexed by marked bipartitions of $n.$ This will lead us to prove that $(\mathcal{H}_n\times \mathcal{H}{n-1},diag (\mathcal{H}{n-1}))$ is a symmetric Gelfand pair and that the induced representation $1{diag (\mathcal{H}{n-1})}{\mathcal{H}_n\times \mathcal{H}{n-1}}$ is multiplicity free.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.