2000 character limit reached
A Castelnuovo-Mumford regularity bound for scrolls
Published 8 Mar 2016 in math.AG | (1603.02382v2)
Abstract: Let $X \subseteq \mathbb{P}r$ be a scroll of codimension $e$ and degree $d$ over a smooth projective curve of genus $g$. The purpose of this paper is to prove a linear Castelnuovo-Mumford regularity bound that reg$(X) \leq d-e+1+g(e-1)$. This bound works over an algebraically closed field of arbitrary characteristic.
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.