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 …

Let S be a numerical monoid (ie an additive submonoid of ℕ0) with minimal generating set〈
n1,…, nt〉. For m∈ S, if, then is called a factorization length of m. We denote by (where mi< …

In this paper, we study the atomic structure of Puiseux monoids generated by monotone
sequences. To understand this atomic structure, it is often useful to know whether the …

Proportionally modular diophantine inequalities - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Help Search My account Sign in View PDF Download …

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

A finitely generated commutative monoid is uniquely presented if it has a unique minimal
presentation. We give necessary and sufficient conditions for finitely generated …

A subset S of non-negative integers N o is called a numerical semigroup if it is a submonoid
of N o and has a finite complement in N o. An undirected graph G (S) associated with S is a …

We introduce a new class of numerical semigroups, which we call the class of acute
semigroups and we prove that they generalize symmetric and pseudosymmetric numerical …

A sharp upper bound for the maximum integer not belonging to an ideal of a numerical
semigroup is given and the ideals attaining this bound are characterized. Then, the result is …

In this article, we consider C-semigroups in N d. We start with symmetric and almost
symmetric C-semigroups and prove that these notions are independent of term orders. We …