Papers
Topics
Authors
Recent
2000 character limit reached

Castelnuovo-Mumford regularity of finite schemes

Published 19 Dec 2024 in math.AG | (2412.15096v2)

Abstract: Let $\Gamma \subset \mathbb{P}n$ be a nondegenerate finite subscheme of degree $d$. Then the Castelnuovo-Mumford regularity ${\rm reg} ({\Gamma})$ of $\Gamma$ is at most $\left\lceil \frac{d-n-1}{t(\Gamma)} \right\rceil +2$ where $t(\Gamma)$ is the smallest integer such that $\Gamma$ admits a $(t+2)$-secant $t$-plane. In this paper, we show that ${\rm reg} ({\Gamma})$ is close to this upper bound if and only if there exists a unique rational normal curve $C$ of degree $t(\Gamma)$ such that ${\rm reg} (\Gamma \cap C) = {\rm reg} (\Gamma)$.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Paper to Video (Beta)

Open Problems

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

Continue Learning

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

Authors (2)

Collections

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