The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev
Arno van den Essen (2004)
Colloquium Mathematicae
Similarity:
The tame generators problem asked if every invertible polynomial map is tame, i.e. a finite composition of so-called elementary maps. Recently in [8] it was shown that the classical Nagata automorphism in dimension 3 is not tame. The proof is long and very technical. The aim of this paper is to present the main ideas of that proof.