The Frobenius problem for numerical semigroups
The paper provides a new method for computing the Frobenius number. The main idea of the method is the following. With the use of special projection any semigroup containing \(\langle n_1,n_2 \rangle\) can be characterized as a subset of incomparable elements of the set \[ B(n_1,n_2)=\{(a,b): 0<a<n_2, 0<b<n_1,\; n_1n_2-an_1-bn_2\geq0\}. \] Using this characterization the algorithm for computing of the Frobenius number of a numerical semigroup is presented. It should be mentioned that the method for the case of three dimensional numerical semigroup is formulated in terms of its minimal system of generators.
- On the Frobenius Problem of Numerical Semigroups
- The Frobenius problem for a class of numerical semigroups
- The Frobenius problem for some numerical semigroups with embedding dimension equal to three
- The Frobenius problem for numerical semigroups with embedding dimension equal to three
- Numerical semigroups with embedding dimension three.
- A Linear Diophantine Problem
- Fundamental gaps of numerical semigroups generated by two elements.
- scientific article; zbMATH DE number 3732172 (Why is no real title available?)
- scientific article; zbMATH DE number 2229032 (Why is no real title available?)
- scientific article; zbMATH DE number 3101854 (Why is no real title available?)
- Numerical semigroups.
- On a linear Diophantine problem of Frobenius.
- Proportionally modular Diophantine inequalities and full semigroups.
- Genus of numerical semigroups generated by three elements.
- A note on the computation of the Frobenius number of a numerical semigroup.
- Dense numerical semigroups
- Numerical semigroups generated by quadratic sequences
- On the numerical semigroup generated by \(\{b^{n+1+i}+\frac{b^{n+i}-1}{b-1}\mid i\in\mathbb{N}\}\)
- Frobenius pseudo-varieties in numerical semigroups.
- Geometrical illustration of numerical semigroups and of some of their invariants.
- The first elements of the quotient of a numerical semigroup by a positive integer
- Balanced numerical semigroups
- The Frobenius problem for Mersenne numerical semigroups
- The Frobenius number and a-invariant
- Solving thousand-digit Frobenius problems using Gröbner bases
- The Frobenius problem for generalized repunit numerical semigroups
- Numerical semigroups with a given set of pseudo-Frobenius numbers
- The Frobenius problem for repunit numerical semigroups.
- Algorithms and basic asymptotics for generalized numerical semigroups in \(\mathbb N^d\)
- An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup.
- The Frobenius problem for numerical semigroups with embedding dimension equal to three
- On numerical semigroups closed with respect to the action of affine maps
- Counting numerical semigroups with short generating functions.
- The genus, Frobenius number, and pseudo-Frobenius numbers of numerical semigroups of type 2
- On the geometry of strongly flat semigroups and their generalizations
- scientific article; zbMATH DE number 7233012 (Why is no real title available?)
- Constructing the set of complete intersection numerical semigroups with a given Frobenius number.
- On the Frobenius Problem of Numerical Semigroups
- Frobenius Numbers of Generalized Fibonacci Semigroups
- scientific article; zbMATH DE number 4089553 (Why is no real title available?)
- The frobenius number of some semigroups
- On the multidimensional Frobenius problem
- An application of integer programming to the decomposition of numerical semigroups
- The Frobenius problem for extended Thabit numerical semigroups
- On certain families of sparse numerical semigroups with Frobenius number even
- The arithmetic extensions of a numerical semigroup
- Numerical semigroups in a problem about cost-effective transport
- Symmetric semigroups with three generators
- The Frobenius problem for a class of numerical semigroups
- Two-extension of a numerical semigroup with embedding dimension two.
- scientific article; zbMATH DE number 2187899 (Why is no real title available?)
- BOUNDS FOR THE GENUS OF NUMERICAL SEMIGROUPS
- Triangular numerical semigroups
- The Frobenius problem for numerical semigroups generated by sequences of the form \(ca^n-d\)
- The Frobenius number of a family of numerical semigroups with embedding dimension \(5\)
- A ``pseudo-polynomial algorithm for the Frobenius number and Gröbner basis
- On integer partitions corresponding to numerical semigroups
- On \(p\)-Frobenius of affine semigroups
- Frobenius pseudo-variety of numerical semigroups with a given multiplicity and ratio
- On the variety of linear recurrences and numerical semigroups
- Numerical semigroups with multiplicity three and four.
- Frobenius numbers of numerical semigroups generated by three consecutive squares or cubes.
This page was built for publication: The Frobenius problem for numerical semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640865)