Multidegrees of tame automorphisms of ℂⁿ

Marek Karaś

  • 2011

Abstract

top
Let F = (F₁,...,Fₙ): ℂⁿ → ℂⁿ be a polynomial mapping. By the multidegree of F we mean mdeg F = (deg F₁, ..., deg Fₙ) ∈ ℕ ⁿ. The aim of this paper is to study the following problem (especially for n = 3): for which sequence (d₁,...,dₙ) ∈ ℕ ⁿ is there a tame automorphism F of ℂⁿ such that mdeg F = (d₁,..., dₙ)? In other words we investigate the set mdeg(Tame(ℂⁿ)), where Tame(ℂⁿ) denotes the group of tame automorphisms of ℂⁿ. Since mdeg(Tame(ℂⁿ)) is invariant under permutations of coordinates, we may focus on the set (d₁,...,dₙ): d₁ ≤ ⋯ ≤ dₙ ∩ mdeg (Tame(ℂⁿ)). Obviously, we have (1,d₂,d₃): 1 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) = (1,d₂,d₃): 1 ≤ d₂ ≤ d₃. Not obvious, but still easy to prove is the equality mdeg(Tame(ℂ³)) ∩ (2,d₂,d₃): 2 ≤ d₂ ≤ d₃ = (2,d₂,d₃): 2 ≤ d₂ ≤ d₃. We give a complete description of the sets (3,d₂,d₃): 3 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) and (5,d₂,d₃): 5 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)). In the examination of the last set the most difficult part is to prove that (5,6,9) ∉ mdeg(Tame(ℂ³)). To do this, we use the two-dimensional Jacobian Conjecture (which is true for low degrees) and the Jung-van der Kulk Theorem. As a surprising consequence of the method used in proving that (5,6,9) ∉ mdeg(Tame(ℂ³)), we show that the existence of a tame automorphism F of ℂ³ with mdeg F = (37,70,105) implies that the two-dimensional Jacobian Conjecture is not true. Also, we give a complete description of the following sets: (p₁,p₂,d₃): 2 < p₁ < p₂ ≤ d₃, p₁,p₂ prime numbers ∩ mdeg(Tame(ℂ³)), (d₁,d₂,d₃): d₁ ≤ d₂ ≤ d₃, d₁,d₂ ∈ 2ℕ +1, gcd(d₁,d₂) = 1 ∩ mdeg(Tame(ℂ³)). Using the description of the last set we show that mdeg(Aut(ℂ³))∖ mdeg(Tame(ℂ³)) is infinite. We also obtain a (still incomplete) description of the set mdeg(Tame(ℂ³)) ∩ (4,d₂,d₃): 4 ≤ d₂ ≤ d₃ and we give complete information about m d e g F - 1 for F ∈ Aut(ℂ²).

How to cite

top

Marek Karaś. Multidegrees of tame automorphisms of ℂⁿ. 2011. <http://eudml.org/doc/286011>.

@book{MarekKaraś2011,
abstract = {Let F = (F₁,...,Fₙ): ℂⁿ → ℂⁿ be a polynomial mapping. By the multidegree of F we mean mdeg F = (deg F₁, ..., deg Fₙ) ∈ ℕ ⁿ. The aim of this paper is to study the following problem (especially for n = 3): for which sequence (d₁,...,dₙ) ∈ ℕ ⁿ is there a tame automorphism F of ℂⁿ such that mdeg F = (d₁,..., dₙ)? In other words we investigate the set mdeg(Tame(ℂⁿ)), where Tame(ℂⁿ) denotes the group of tame automorphisms of ℂⁿ. Since mdeg(Tame(ℂⁿ)) is invariant under permutations of coordinates, we may focus on the set (d₁,...,dₙ): d₁ ≤ ⋯ ≤ dₙ ∩ mdeg (Tame(ℂⁿ)). Obviously, we have (1,d₂,d₃): 1 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) = (1,d₂,d₃): 1 ≤ d₂ ≤ d₃. Not obvious, but still easy to prove is the equality mdeg(Tame(ℂ³)) ∩ (2,d₂,d₃): 2 ≤ d₂ ≤ d₃ = (2,d₂,d₃): 2 ≤ d₂ ≤ d₃. We give a complete description of the sets (3,d₂,d₃): 3 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) and (5,d₂,d₃): 5 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)). In the examination of the last set the most difficult part is to prove that (5,6,9) ∉ mdeg(Tame(ℂ³)). To do this, we use the two-dimensional Jacobian Conjecture (which is true for low degrees) and the Jung-van der Kulk Theorem. As a surprising consequence of the method used in proving that (5,6,9) ∉ mdeg(Tame(ℂ³)), we show that the existence of a tame automorphism F of ℂ³ with mdeg F = (37,70,105) implies that the two-dimensional Jacobian Conjecture is not true. Also, we give a complete description of the following sets: (p₁,p₂,d₃): 2 < p₁ < p₂ ≤ d₃, p₁,p₂ prime numbers ∩ mdeg(Tame(ℂ³)), (d₁,d₂,d₃): d₁ ≤ d₂ ≤ d₃, d₁,d₂ ∈ 2ℕ +1, gcd(d₁,d₂) = 1 ∩ mdeg(Tame(ℂ³)). Using the description of the last set we show that mdeg(Aut(ℂ³))∖ mdeg(Tame(ℂ³)) is infinite. We also obtain a (still incomplete) description of the set mdeg(Tame(ℂ³)) ∩ (4,d₂,d₃): 4 ≤ d₂ ≤ d₃ and we give complete information about $mdeg F^\{-1\}$ for F ∈ Aut(ℂ²).},
author = {Marek Karaś},
keywords = {polynomial automorphism; tame automorphsm; wild automorphism; multidegree},
language = {eng},
title = {Multidegrees of tame automorphisms of ℂⁿ},
url = {http://eudml.org/doc/286011},
year = {2011},
}

TY - BOOK
AU - Marek Karaś
TI - Multidegrees of tame automorphisms of ℂⁿ
PY - 2011
AB - Let F = (F₁,...,Fₙ): ℂⁿ → ℂⁿ be a polynomial mapping. By the multidegree of F we mean mdeg F = (deg F₁, ..., deg Fₙ) ∈ ℕ ⁿ. The aim of this paper is to study the following problem (especially for n = 3): for which sequence (d₁,...,dₙ) ∈ ℕ ⁿ is there a tame automorphism F of ℂⁿ such that mdeg F = (d₁,..., dₙ)? In other words we investigate the set mdeg(Tame(ℂⁿ)), where Tame(ℂⁿ) denotes the group of tame automorphisms of ℂⁿ. Since mdeg(Tame(ℂⁿ)) is invariant under permutations of coordinates, we may focus on the set (d₁,...,dₙ): d₁ ≤ ⋯ ≤ dₙ ∩ mdeg (Tame(ℂⁿ)). Obviously, we have (1,d₂,d₃): 1 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) = (1,d₂,d₃): 1 ≤ d₂ ≤ d₃. Not obvious, but still easy to prove is the equality mdeg(Tame(ℂ³)) ∩ (2,d₂,d₃): 2 ≤ d₂ ≤ d₃ = (2,d₂,d₃): 2 ≤ d₂ ≤ d₃. We give a complete description of the sets (3,d₂,d₃): 3 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)) and (5,d₂,d₃): 5 ≤ d₂ ≤ d₃ ∩ mdeg(Tame(ℂ³)). In the examination of the last set the most difficult part is to prove that (5,6,9) ∉ mdeg(Tame(ℂ³)). To do this, we use the two-dimensional Jacobian Conjecture (which is true for low degrees) and the Jung-van der Kulk Theorem. As a surprising consequence of the method used in proving that (5,6,9) ∉ mdeg(Tame(ℂ³)), we show that the existence of a tame automorphism F of ℂ³ with mdeg F = (37,70,105) implies that the two-dimensional Jacobian Conjecture is not true. Also, we give a complete description of the following sets: (p₁,p₂,d₃): 2 < p₁ < p₂ ≤ d₃, p₁,p₂ prime numbers ∩ mdeg(Tame(ℂ³)), (d₁,d₂,d₃): d₁ ≤ d₂ ≤ d₃, d₁,d₂ ∈ 2ℕ +1, gcd(d₁,d₂) = 1 ∩ mdeg(Tame(ℂ³)). Using the description of the last set we show that mdeg(Aut(ℂ³))∖ mdeg(Tame(ℂ³)) is infinite. We also obtain a (still incomplete) description of the set mdeg(Tame(ℂ³)) ∩ (4,d₂,d₃): 4 ≤ d₂ ≤ d₃ and we give complete information about $mdeg F^{-1}$ for F ∈ Aut(ℂ²).
LA - eng
KW - polynomial automorphism; tame automorphsm; wild automorphism; multidegree
UR - http://eudml.org/doc/286011
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.