82 research outputs found

    Graver bases of shifted numerical semigroups with 3 generators

    Full text link
    A numerical semigroup MM is a subset of the non-negative integers that is closed under addition. A factorization of n∈Mn \in M is an expression of nn as a sum of generators of MM, and the Graver basis of MM is a collection Gr(Mt)Gr(M_t) of trades between the generators of MM that allows for efficient movement between factorizations. Given positive integers r1,…,rkr_1, \ldots, r_k, consider the family Mt=⟨t+r1,…,t+rk⟩M_t = \langle t + r_1, \ldots, t + r_k\rangle of "shifted" numerical semigroups whose generators are obtained by translating r1,…,rkr_1, \ldots, r_k by an integer parameter tt. In this paper, we characterize the Graver basis Gr(Mt)Gr(M_t) of MtM_t for sufficiently large tt in the case k=3k = 3, in the form of a recursive construction of Gr(Mt)Gr(M_t) from that of smaller values of tt. As a consequence of our result, the number of trades in Gr(Mt)Gr(M_t), when viewed as a function of tt, is eventually quasilinear. We also obtain a sharp lower bound on the start of quasilinear behavior
    • …
    corecore