### An Algorithm for the Quillen-Suslin Theorem for Monoid Rings, by Reinhard C. Laubenbacher and Cynthia Woodburn

Let k be a field, and let M be a commutative, seminormal, finitely
generated monoid, which is torsionfree, cancellative,
and has no nontrivial units. J. Gubeladze proved that finitely generated
projective modules over kM are free.
This paper contains an algorithm for finding a free basis for a finitely
generated projective module over kM. As applications one obtains
alternative algorithms for the Quillen-Suslin Theorem for
polynomial rings and Laurent polynomial rings, based on Quillen's proof.

Reinhard C. Laubenbacher <reinhard@nmsu.edu>

Cynthia Woodburn <cwoodbur@pittstate.edu>