Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Asymptotic Growth of Trivial Summands in Tensor Powers (2501.11125v1)

Published 19 Jan 2025 in math.RT

Abstract: Given a finite-dimensional representation $V$ over an algebraically closed field of an abstract group $G$, we consider the number of the trivial summand counted with multiplicity in the direct sum decomposition of $V{\otimes n}$. We give necessary and sufficient conditions when the field is of characteristic $0$ and when the field is of characteristic $p$ so that $(V{\otimes n})_n$ has a subsequence $(V{\otimes n_k})_k$ such that $V{\otimes n_k}$ contains enough trivial summands when $k$ is sufficiently large.

Summary

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