Factoring in embedding dimension three numerical semigroups.
Frobenius numbers by lattice point enumeration.
Generalized Frobenius numbers: bounds and average behavior
On a linear Diophantine problem of Frobenius.
On a linear Diophantine problem of Frobenius. II.
On the Frobenius number of a modular Diophantine inequality
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.
On the Frobenius number of a proportionally modular Diophantine inequality.
On the Frobenius number of Fibonacci numerical semigroups.
On the Frobenius number of some Lucas numerical semigroups.
On the Frobenius problem for .
On the limit distribution of Frobenius numbers
The covariety of perfect numerical semigroups with fixed Frobenius number
Let be a numerical semigroup. We say that is an isolated gap of if A numerical semigroup without isolated gaps is called a perfect numerical semigroup. Denote by the multiplicity of a numerical semigroup . A covariety is a nonempty family of numerical semigroups that fulfills the following conditions: there exists the minimum of the intersection of two elements of is again an element of , and for all such that We prove that the set is a perfect numerical semigroup with...
The Frobenius number of geometric sequences.
Unbounded discrepancy in Frobenius numbers.