We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
We study the semigroups isomorphic to principal ideals of finitely generated commutative monoids. We define the concept of finite presentation for this kind of semigroups. Furthermore, we show how to obtain information on these semigroups from their presentations.
We study numerical semigroups with the property that if is the multiplicity of and is the least element of congruent with modulo , then . The set of numerical semigroups with this property and fixed multiplicity is bijective with an affine semigroup and consequently it can be described by a finite set of parameters. Invariants like the gender, type, embedding dimension and Frobenius number are computed for several families of this kind of numerical semigroups.
Download Results (CSV)