On permutation numerical semigroups

MaRDI QIDQ6277174zbMATH OpenFDO

Authors Simone Ugolini

Publication date 5 September 2016

Mathematics Subject Classification ID

The Frobenius problem (11D07) Commutative semigroups (20M14)

Abstract: In this paper we introduce the notion of $n$-permutation numerical semigroup. While there are just three $2$-permutation numerical semigroups, there are infinitely many $n$-permutation numerical semigroups if $n>2$. We construct $16$ families of $3$-permutation numerical semigroups and one family of $n$-permutation numerical semigroups. Finally we present some experimental data, which seem to support a conjecture about the classification of $3$-permutation numerical semigroups.

This page was built for publication: On permutation numerical semigroups

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