Document Type

Article

Publication Date

2006

Abstract

Varying methods exist for computing a presentation of a finitely generated commutative cancellative monoid. We use an algorithm of Contejean and Devie [An efficient incremental algorithm for solving systems of linear diophantine equations, Inform. and Comput. 113 (1994) 143–172] to show how these presentations can be obtained from the nonnegative integer solutions to a linear system of equations. We later introduce an alternate algorithm to show how such a presentation can be efficiently computed from an integer basis.

Document Object Identifier (DOI)

10.1016/j.dam.2006.03.013

Publication Information

Discrete Applied Mathematics

Included in

Mathematics Commons

Share

COinS