2000 character limit reached
Bounding the homology of FI-modules
Published 22 Dec 2016 in math.RT, math.AT, and math.CO | (1612.07803v1)
Abstract: The main theorem of Church-Ellenberg [arXiv:1506.01022] is a sharp bound on the homology of FI-modules, showing that the Castelnuovo-Mumford regularity of FI-modules over Z can be bounded in terms of generators and relations. We give a new proof of this theorem, inspired by earlier proofs by Li-Yu and Li. This should be read after Section 2 of Church-Ellenberg, which contains all needed terminology and background.
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.
