The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev
Colloquium Mathematicae (2004)
- Volume: 100, Issue: 2, page 181-194
- ISSN: 0010-1354
Access Full Article
top
Abstract
topHow to cite
topArno van den Essen. "The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev." Colloquium Mathematicae 100.2 (2004): 181-194. <http://eudml.org/doc/283805>.
@article{ArnovandenEssen2004,
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.},
author = {Arno van den Essen},
journal = {Colloquium Mathematicae},
keywords = {Nagata example; polynomial automorphism; tame automorphism},
language = {eng},
number = {2},
pages = {181-194},
title = {The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev},
url = {http://eudml.org/doc/283805},
volume = {100},
year = {2004},
}
TY - JOUR
AU - Arno van den Essen
TI - The solution of the Tame Generators Conjecture according to Shestakov and Umirbaev
JO - Colloquium Mathematicae
PY - 2004
VL - 100
IS - 2
SP - 181
EP - 194
AB - 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.
LA - eng
KW - Nagata example; polynomial automorphism; tame automorphism
UR - http://eudml.org/doc/283805
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.