2000 character limit reached
Growth rates of the number of indecomposable summands in tensor powers
Published 2 Jan 2023 in math.RT, math.CT, and math.RA | (2301.00885v2)
Abstract: In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super)schemes and related objects.
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.