Sahin, MesutMathematics2024-10-062024-10-0620090002-9939https://hdl.handle.net/20.500.14411/8835Sahin, Mesut/0000-0002-0310-2542In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in Pn+1, starting with a single set-theoretic complete intersection monomial curve in P-n. Moreover we investigate the numerical criteria to decide when these monomial curves can or cannot be obtained via semigroup gluing.eninfo:eu-repo/semantics/closedAccessSet-theoretic complete intersectionsmonomial curvesArticleQ2Q3137412231233WOS:0002619688000087