paper

On binomial equations defining rational normal scrolls

arXiv:math/0602609

Abstract

We show that a rational normal scroll can in general be set-theoretically defined by a proper subset of the 2-minors of the associated two-row matrix. This allows us to find a class of rational normal scrolls that are almost set-theoretic complete intersections.

References in corpus (2)

On binomial equations defining rational normal scrolls · wovepaper