Algorithms in linear algebraic groups (Q2173661)

The main result that the authors obtain is the following Theorem: Let \(G\) be a reductive linear algebraic group defined over an algebraically closed field \(k\) of \(\mathrm{char} \neq 2\) which has the Steinberg presentation. Then every element of \(G\) can be written as a word in Steinberg generators and a diagonal matrix. The diagonal matrix is: \(\mathrm{diag}(\alpha,1,\ldots,1,\lambda,\mu(g),\ldots,\mu(g), \mu(g)\lambda^{-1})\), where \(\alpha,\lambda,\mu(g) \in k^\times\), in its natural presentation. Furthermore, the length of the word is bounded by \(\mathcal{O}(l^3)\), where \(l\) is the rank of the group \(G\).