2000 character limit reached
Bounding regularity of $FI^m$-modules
Published 29 Jul 2024 in math.RT | (2407.20428v1)
Abstract: Let $FI$ be a skeleton of the category of finite sets and injective maps, and $FIm$ the product of $m$ copies of $FI$. We prove that if an $FIm$-module is generated in degree $\leqslant d$ and related in degree $\leqslant r$, then its regularity is bounded above by a function of $m$, $d$, and $r$.
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.