The Frobenius problem for numerical semigroups (Q640865): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58842630 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jnt.2011.05.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2022468054 / rank | |||
Normal rank | |||
Revision as of 23:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Frobenius problem for numerical semigroups |
scientific article |
Statements
The Frobenius problem for numerical semigroups (English)
0 references
21 October 2011
0 references
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.
0 references
Frobenius number
0 references
numerical semigroup
0 references
