Papers
Topics
Authors
Recent
Search
2000 character limit reached

Plucker-Clebsch formula in higher dimension

Published 27 Jan 2010 in math.AG | (1001.4874v1)

Abstract: Let $S\subset\Psr$ ($r\geq 5$) be a nondegenerate, irreducible, smooth, complex, projective surface of degree $d$. Let $\delta_S$ be the number of double points of a general projection of $S$ to $\Ps4$. In the present paper we prove that $ \delta_S\leq{\binom {d-2} {2}}$, with equality if and only if $S$ is a rational scroll. Extensions to higher dimensions are discussed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

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

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.

Collections

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