Skip to main content
added 145 characters in body
Source Link
gio
  • 1.2k
  • 7
  • 17

Given the equation of a cubic hypersurface $C\subset\mathbb{P}^{N}_{\mathbb{C}}$ ($N\geq 4$), there is an algorithm (or better a software) that allows to determine if $C$ is factorial (i.e., all of whose local rings are unique factorization domains, and hence there is no distinction between Cartier divisors and Weil divisors), and if $\mathrm{Pic}(C)=\mathbb{Z}\langle\mathcal{O}_C(1)\rangle$ ? Of course this is trivial if $C$ is smooth.

Thanks.

Given the equation of a cubic hypersurface $C\subset\mathbb{P}^{N}_{\mathbb{C}}$ ($N\geq 4$), there is an algorithm (or better a software) that allows to determine if $C$ is factorial, and if $\mathrm{Pic}(C)=\mathbb{Z}\langle\mathcal{O}_C(1)\rangle$ ? Of course this is trivial if $C$ is smooth.

Thanks.

Given the equation of a cubic hypersurface $C\subset\mathbb{P}^{N}_{\mathbb{C}}$ ($N\geq 4$), there is an algorithm (or better a software) that allows to determine if $C$ is factorial (i.e., all of whose local rings are unique factorization domains, and hence there is no distinction between Cartier divisors and Weil divisors), and if $\mathrm{Pic}(C)=\mathbb{Z}\langle\mathcal{O}_C(1)\rangle$ ? Of course this is trivial if $C$ is smooth.

Thanks.

Source Link
gio
  • 1.2k
  • 7
  • 17

Cubic hypersurfaces of complex projective space

Given the equation of a cubic hypersurface $C\subset\mathbb{P}^{N}_{\mathbb{C}}$ ($N\geq 4$), there is an algorithm (or better a software) that allows to determine if $C$ is factorial, and if $\mathrm{Pic}(C)=\mathbb{Z}\langle\mathcal{O}_C(1)\rangle$ ? Of course this is trivial if $C$ is smooth.

Thanks.