Sahin,M.MathematicsInternational Relations2024-07-052024-07-05200970002-993910.1090/S0002-9939-08-09653-62-s2.0-77950613767https://doi.org/10.1090/S0002-9939-08-09653-6https://hdl.handle.net/20.500.14411/3614In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in ℙn+1, starting with a single set-theoretic complete intersection monomial curve in ℙn. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing. © 2008 American Mathematical Society.eninfo:eu-repo/semantics/openAccessMonomial curvesSet-theoretic complete intersectionsArticleQ2137412231233