|
|||||
|
|
Presentations of finitely generated cancellative commutative monoids and nonnegative solutions of systems of linear equations |
|
| Authors: | ST Chapman PA García-Sánchez D Llena |
| Institution: | a Department of Mathematics, Trinity University, One Trinity Place, San Antonio, TX 78212-7200, USA b Departamento de Álgebra, Universidad de Granada, 18071 Granada, Spain c Departamento de Geometría, Topología y Química Orgánica, Universidad de Almería, La Cañada de San Urbano s/n, 04120 Almería, Spain d Departamento de Álgebra, Universidad de Granada, 18071 Granada, Spain |
| 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. |
| Keywords: | 20M14 20M15 |
| 本文献已被 ScienceDirect 等数据库收录！ | |