Irreducibility of Arf numerical semigroups (Q2684024)

From MaRDI portal
Revision as of 02:24, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Irreducibility of Arf numerical semigroups
scientific article

    Statements

    Irreducibility of Arf numerical semigroups (English)
    0 references
    0 references
    15 February 2023
    0 references
    A subset \(H\) of \(\mathbb{N}\) is a numerical semigroup if it is closed under addition, has a finite complement in \(\mathbb{N}\) and \(0\in H\). A numerical semigroup \(H\) is Arf if for all \(h_i , h_j , h_k \in H\), with \(h_i \geq h_j \geq h_k\), we have \(h_i + h_j - h_k\in H\). An element \(x\in\mathbb{N}\) is a gap of \(H\) if \(x\notin H\). A numerical semigroup is irreducible if it cannot be expressed as an intersection of two numerical semigroups containing it properly. In Section 2, the author introduces the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. In Section 3, the author introduces the concept of Arf-irreducible numerical semigroups as follows: An Arf numerical semigroup is called Arf-irreducible if it can not be expressed as the intersection of two Arf numerical semigroups containing it properly. Obviously, every irreducible Arf numerical semigroup is Arf-irreducible. However, an Arf-irreducible numerical semigroup need not be an irreducible numerical semigroup. The author draws conclusions about all these concepts. Next, the author gives a system of generators for the Frobenius variety and variety of families of Arf numerical semigroups. Finally, the author obtains the minimal Arf system of generators of a given Arf numerical semigroup.
    0 references
    Arf special gaps
    0 references
    special gaps
    0 references
    Arf-irreducible numerical semigroups
    0 references
    Frobenius variety
    0 references
    minimal Arf system of generators
    0 references

    Identifiers