Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 75 tok/s
Gemini 2.5 Pro 55 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 113 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 459 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

Finite Gelfand pairs and cracking points of the symmetric groups (1908.11045v1)

Published 29 Aug 2019 in math.RT and math.GR

Abstract: Let $\Gamma$ be a finite group. Consider the wreath product $G_n := \Gamman \rtimes S_n$ and the subgroup $K_n := \Delta_n \times S_n\subseteq G_n$, where $S_n$ is the symmetric group and $\Delta_n$ is the diagonal subgroup of $\Gamman$. For certain values of $n$ (which depend on the group $\Gamma$), the pair $(G_n, K_n)$ is a Gelfand pair. It is not known for all finite groups which values of $n$ result in Gelfand pairs. Building off the work of Benson--Ratcliff, we obtain a result which simplifies the computation of multiplicities of irreducible representations in certain tensor product representations, then apply this result to show that for $\Gamma = S_k, \ k \geq 5$, $(G_n,K_n)$ is a Gelfand pair exactly when $n = 1,2$.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube