Numerical semigroups generated by intervals (Q1568891)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Numerical semigroups generated by intervals
scientific article

    Statements

    Numerical semigroups generated by intervals (English)
    0 references
    22 June 2000
    0 references
    The authors study the semigroups generated by intervals of nonnegative integers, that is semigroups of the form \(S=\langle a,a+1,\dots,a+x\rangle\). For a semigroup of this kind they solve the following problems: Membership problem. An element \(n\in\mathbb{N}\) belongs to \(S=\langle a,a+1,\dots,a+x\rangle\) if and only if \(n\bmod a\leq \lfloor\tfrac na\rfloor x\), where \(\lfloor\tfrac na\rfloor\) is quotient of the integer division of \(n\) by \(a\), and \(n\bmod a\) denotes the remainder of this division, \(n-\lfloor\tfrac na\rfloor a\). Computation of the Frobenius number of the semigroup. The Frobenius number of a numerical semigroup (also known as the conductor of the semigroup) is the greatest integer not belonging to the given semigroup. The Frobenius number of \(S=\langle a,a+1,\dots,a+x\rangle\) is \(a\) times the least integer greater than or equal to \(\tfrac{a-1}x\) minus \(1\). Symmetry of the semigroup. A numerical semigroup \(T\) with Frobenius number \(C\) is symmetric if and only if for each \(z\in\mathbb{Z}\) we have that either \(z\in S\) or \(C-z\in S\). The semigroup \(S=\langle a,a+1,\dots,a+x\rangle\) is symmetric if and only if \(a\equiv 2\bmod x\). Cardinality of a minimal presentation of \(S\). The semigroup \(S=\langle a,a+1,\dots,a+x\rangle\) is isomorphic to \(\mathbb{N}^{x+1}/\sigma\), where \(\sigma\) is the kernel congruence of the semigroup morphism \[ \varphi\colon\mathbb{N}^{x+1}\to S,\quad\varphi(n_0,\dots,n_x)=\sum_i^xn_i(a+i), \] that is to say \(a\sigma b\) if and only if \(\varphi(a)=\varphi(b)\). A minimal presentation of \(S\) is a minimal system of generators of the congruence \(\sigma\). They show that the cardinality of a minimal presentation of \(S\) is \[ \tfrac{x(x-1)}2+x-((a-1)\bmod x). \] Complete intersection semigroups. A numerical semigroup is a complete intersection if the cardinality of a minimal presentation plus one equals the cardinality of a minimal system of generators of the given semigroup. They show that the semigroup \(S=\langle a,a+1,\dots,a+x\rangle\) is a complete intersection if and only if \(S\) is \(\langle a,a+1\rangle\) or \(\langle 2k,2k+1,2k+2\rangle\).
    0 references
    numerical semigroups
    0 references
    membership problem
    0 references
    Frobenius numbers
    0 references
    symmetric numerical semigroups
    0 references
    complete intersection numerical semigroups
    0 references
    minimal presentations
    0 references

    Identifiers