Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations. (Q2506358)

The authors investigate three types of algorithms for computing presentations of finitely generated commutative cancellative monoids. The problem is reduced to a system of linear equations and linear congruences. The authors also show how such presentations can be efficiently computed from an integer basis. The implementation of the first group of algorithms depends on the computation of Gröbner bases; the second group of algorithms is based on the computation of a minimal presentation of a numerical semigroup and the third one is devoted to the computation of irreducibles.