An algorithmic proof of Suslin's stability theorem for polynomial rings (Q1904081)

Let \(k\) be a field, \(n,m\) integers, \(n \geq 3\). \textit{A. Suslin} proved that every \(n\) by \(n\) matrix of determinant one over a polynomial ring \(k[x_1, \dots, x_m]\) is a product of elementary matrices. In the paper, it is suggested how one might actually find such a factorization by using a Gröbner basis technique.