Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Jacobian Conjecture in two dimension (1306.3314v2)

Published 14 Jun 2013 in math.AG and math.AC

Abstract: Let $(P, Q)$ be a pair of Jacobian polynomials. We can show that $ <P, Q>+l+2g(P)-2= 0= <P, [P,Q]>$, where $<f, g>$ is the intersection number of $f, g\in \CC[x, y]$ in the affine plane, $l$ is the number of branch at point at infinity and $g(P)$ is the geometric genus of affine curve defined by $P$. Hence we can show that every Jacobian polynomial defines a smooth rational curve with one point at infinity. It is sufficient to fix the Jacobian conjecture in two dimension by the Abhyankar theorem or the Abhyankar-Moh-Suzuki theorem.

Summary

We haven't generated a summary for this paper yet.