Abstract
An ‐semigroup is a numerical semigroup without consecutive small elements. This work generalizes this concept to finite‐complement submonoids of an affine cone . We develop algorithmic procedures to compute all ‐semigroups with a given Frobenius element (denoted by ) and with fixed Frobenius element and multiplicity. Moreover, we analyze the ‐systems of generators. Furthermore, we study ‐numerical semigroups with maximal embedding dimension, a fixed Frobenius number. and multiplicity, providing an algorithm for their computation and a graphical classification.
Funding Information
  • Universidad de Cádiz

This publication has 13 references indexed in Scilit: