The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev
Volume 100 / 2004
Colloquium Mathematicum 100 (2004), 181-194
MSC: 14R10, 14E07.
DOI: 10.4064/cm100-2-3
Abstract
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.
