Equations defining recursive extensions as set theoretic complete intersections

From MaRDI portal



Abstract: Based on the fact that projective monomial curves in the plane are complete intersections, we give an effective inductive method for creating infinitely many monomial curves in the projective n-space that are set theoretic complete intersections. We illustrate our main result by giving different infinite families of examples. Our proof is constructive and provides one binomial and (n−2) polynomial explicit equations for the hypersurfaces cutting out the curve in question.


The aim of this paper is to construct a family of projective monomial curves that are set theoretical complete intersections (stci). More precisely a projective monomial curve \(C(m_1,\dots,m_n)\subset {\mathbb P}^n\) is given parametrically by \((s^{m_n}, s^{m_n-m_1}t^{m_1},\dots,s^{m_n-m_{n-1}}t^{m_{n-1}},t^{m_n})\). Let \(I\subset S:=K[x_0,\dots,x_n]\) be its defining ideal. Recall that \(I\) is a stci if there exists \(n-1\) polynomials \(f_1,\dots,f_{n-1}\in K[x_0,\dots,x_n]\) such that \(\mathrm{rad }(I)=\mathrm{rad }(f_1,\dots,f_{n-1})\). The authors consider monomial curves with the property (*) For any \(i\geq 3\) the number \(m_i\) belongs to the semigroup generated by \(m_1,\dots,m_{i-1}\). They prove that under some extra technical conditions, monomial curves satisfying condition (*) are stci.











This page was built for publication: Equations defining recursive extensions as set theoretic complete intersections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498659)