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.

• 0124.bib (279 bytes)
• paper.dvi (138220 bytes) [May 8, 1996]
• paper.dvi.gz (54271 bytes)
• paper.pdf (248309 bytes)
• paper.ps.gz (221863 bytes)