The n-GCD conjecture for polynomial automorphisms

About 10 years old · traced to

Let F:C[x1,…,xn]→C[x1,…,xn]F:\mathbb{C}[x_1,\ldots,x_n] \to \mathbb{C}[x_1,\ldots,x_n] be a C\mathbb{C}-algebra endomorphism with invertible Jacobian. Write Fi=F(xi)F_i=F(x_i), and let lil_i be the degree of FiF_i for 1≤i≤n1\leq i\leq n. The nn-GCD conjecture. If

gcd⁡(lu,lv)=1\gcd(l_u,l_v)=1

for every pair 1≤u≠v≤n1\leq u\ne v\leq n, then FF is an automorphism. This extends the two-variable Magnus-type results to higher dimensions, but the supplied text gives no resolution of the conjecture.

References

Primary source

Vered Moskowicz, “Ideas about the Jacobian Conjecture”, arXiv:1610.01621 (2016).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.