Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
96 tokens/sec
Gemini 2.5 Pro Premium
42 tokens/sec
GPT-5 Medium
20 tokens/sec
GPT-5 High Premium
27 tokens/sec
GPT-4o
100 tokens/sec
DeepSeek R1 via Azure Premium
86 tokens/sec
GPT OSS 120B via Groq Premium
464 tokens/sec
Kimi K2 via Groq Premium
181 tokens/sec
2000 character limit reached

Covering $\mathsf{Irrep}(S_n)$ With Tensor Products and Powers (2004.05283v4)

Published 11 Apr 2020 in math.CO and math.RT

Abstract: We study when a tensor product of irreducible representations of the symmetric group $S_n$ contains all irreducibles as subrepresentations; we say such a tensor product covers $\mathsf{Irrep}(S_n)$. Our results show that this behavior is typical. We first give a general sufficient criterion for tensor products to have this property, which holds asymptotically almost surely for constant-sized collections of (Plancherel or uniformly) random irreducibles. We also consider the minimal tensor power of a single fixed irreducible representation needed to cover $\mathsf{Irrep}(S_n)$. Here a simple lower bound comes from considering dimensions, and we show it is always tight up to a universal constant factor as was recently conjectured by Liebeck, Shalev, and Tiep.

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)