The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev
Arno van den Essen
Colloquium Mathematicae, Tome 100 (2004), p. 181-194 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

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.

Publié le : 2004-01-01
EUDML-ID : urn:eudml:doc:283805 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-cm100-2-3,
     author = {Arno van den Essen},
     title = {The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev},
     journal = {Colloquium Mathematicae},
     volume = {100},
     year = {2004},
     pages = {181-194},
     zbl = {1060.14087},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm100-2-3}
}

Arno van den Essen. The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev. Colloquium Mathematicae, Tome 100 (2004) pp. 181-194. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-cm100-2-3/