On binomial equations defining rational normal scrolls
classification
🧮 math.AG
math.AC
keywords
normalrationalscrollsallowsalmostassociatedbinomialclass
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.