In this paper we describe an algorithm for producing infinitely many examples of set-theoretic complete intersection monomial curves in P n+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.

Let G be a group. Recall that the intersection graph of subgroups of G is an undirected graph whose vertex set is the set of all nontrivial subgroups of G and distinct vertices H,K are joined by an edge in this graph if and only if the intersection of H and K is nontrivial. The aim of this article is to investigate the interplay between the group-theoretic properties of a finite group G and the...