Generalized Numerical semigroups up to isomorphism

Abstract: A generalized numerical semigroup is a submonoid $S$ of $\mathbb{N}^d$ with finite complement in it. We characterize isomorphisms between these monoids in terms of permutation of coordinates. Considering the equivalence relation that identifies the monoids obtained by the action of a permutation and establishing a criterion to select a representative from each equivalence class, we define some procedures for generating the set of all generalized numerical semigroups of given genus up to isomorphism. Finally, we present computational data and explore properties related to the number of generalized numerical semigroups of a given genus up to isomorphism.