2000 character limit reached
Castelnuovo-Mumford regularity of representations of certain product categories
Published 20 Mar 2019 in math.RT, math.KT, and math.RA | (1903.08317v3)
Abstract: We show in this paper that representations of a finite product of categories satisfying certain combinatorial conditions have finite Castelnuovo-Mumford regularity if and only if they are presented in finite degrees, and hence the category consisting of them is abelian. These results apply to examples such as the categories $\mathrm{FI}m$ and $\mathrm{FI}_Gm$.
Sponsor
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.