Generalized numerical semigroups up to isomorphism

From MaRDI portal





A submonoid \(S\) of \(\mathbb {N}^d\) where \(d\) is a positive integer is called a generalized numerical semigroup (GNS) if the set \(H(S)=\mathbb {N}^d \setminus S\) is finite. The set \(H(S)\) is called the set of gaps (or holes) of \(S\) and its cardinality \(g(S) = |H(S)|\) is called the genus of \(S\). For a positive integer \(g\), the set of GNSs in \(\mathbb {N}^d \) having genus \(g\) is denoted by \(S_{g,d }\). The following equivalence relation \(\simeq \) in the set \(S_{g,d }\) is considered: \(S_1 \simeq S_2 \) for \(S_1, S_2 \in S_{g,d}\) if \(S_2\) can be obtained by a permutation of the coordinates of \(S_1\). It is proved that two GNSs in \(\mathbb {N}^d \) are isomorphic if and only if they differ only by a permutation of coordinates, that is, \(S_1\) and \(S_2\) are isomorphic GNSs in \(\mathbb {N}^d \) if and only if \(S_1 \simeq S_2\). A procedure is given to generate such a generalized numerical semigroup \(S\) whose isomorphism equivalence class has cardinality equal to one. A criterion is given to identify a representative in every isomorphism equivalence class of a GNS. The authors ``present computational data and explore properties related to the number of generalized numerical semigroups of a given genus up to isomorphism.











This page was built for publication: Generalized numerical semigroups up to isomorphism

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