2000 character limit reached
Strong Gelfand Pairs of the Dihedral and Dicyclic Groups (2508.10756v1)
Published 14 Aug 2025 in math.RT and math.GR
Abstract: A strong Gelfand pair $(G, H)$ is a finite group $G$ and a subgroup $H$ where every irreducible character of $H$ induces to a multiplicity-free character of $G$. We determine the strong Gelfand pairs of the dihedral groups $D_{2n}$ and the dicyclic groups $Dic_{4n}$ for all $n$.
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.
