Factorial hypersurfaces in P⁴ with nodes
classification
🧮 math.AG
keywords
factorialnodesdegreehypersurfacehypersurfacesnodalprove
read the original abstract
We prove that for n= 5, 6, 7, a nodal hypersurface of degree n in P^4 is factorial if it has at most (n-1)^2-1 nodes.
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.