During the early part of the last century, Ferdinand Georg Frobenius (1849-1917) raised he
following problem, known as the Frobenius Problem (FP): given relatively prime positive …

Nonunique factorization in commutative monoids is often studied using factorization
invariants, which assign to each monoid element a quantity determined by the factorization …

Numerical Semigroups Page 1 JC Rosales PA García-Sánchez DEVELOPMENTS IN
MATHEMATICS 20 Numerical Semigroups Page 2 NUMERICAL SEMIGROUPS Page 3 …

The greatest integer that does not belong to a numerical semigroup S is called the
Frobenius number of S. The Frobenius problem, which is also called the coin problem or the …

The greatest integer that does not belong to a numerical semigroup S is called the
Frobenius number of S, and finding the Frobenius number is called the Frobenius problem …

We introduce the concept of homogeneous numerical semigroups and show that all
homogeneous numerical semigroups with Cohen–Macaulay tangent cones are of …

We continue our study of exponent semigroups of rational matrices. Our main result is that
the matricial dimension of a numerical semigroup is at most its multiplicity (the least …

Let n be a positive integer greater than 2. We define the Proth numerical semigroup, P k (n),
generated by {k 2 n+ i+ 1∣ i∈ N}, where k is an odd positive number and k< 2 n. In this …

We construct symmetric numerical semigroups $ S $ for every minimal number of generators
$\mu (S) $ and multiplicity $\mathsf {m}(S) $, $2\leq\mu (S)\leq\mathsf {m}(S)-1 …

We consider several classes of complete intersection numerical semigroups, arising from
many different contexts like algebraic geometry, commutative algebra, coding theory and …