2000 character limit reached
Plucker-Clebsch formula in higher dimension (1001.4874v1)
Published 27 Jan 2010 in math.AG
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.