Every positive integer is the Frobenius number of an irreducible numerical semigroup with at most four generators. (Q1880455): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: José Carlos Rosales / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Carlos Galindo Pastor / rank | |||
Normal rank |
Revision as of 12:02, 13 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Every positive integer is the Frobenius number of an irreducible numerical semigroup with at most four generators. |
scientific article |
Statements
Every positive integer is the Frobenius number of an irreducible numerical semigroup with at most four generators. (English)
0 references
28 September 2004
0 references
The Frobenius number \(g(S)\) of a numerical semigroup \(S\) is the maximum of the set \(\mathbb{N}\setminus S\). A (numerical) semigroup is irreducible if it cannot be expressed as the intersection of two numerical semigroups properly containing it. Irreducible semigroups are closely related to symmetric and pseudo-symmetric ones. The interest in these types of semigroups comes from ring theory, since they provide Gorenstein and Kunz semigroup rings. For any positive integer \(g\), the authors give an easy method to get irreducible semigroups of Frobenius number \(g\). These semigroups have at most four generators, being that the least number of generators needed for the general case.
0 references
Frobenius numbers
0 references
irreducible numerical semigroups
0 references
intersections of numerical semigroups
0 references
numbers of generators
0 references