Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up