The Newton-polygon divisibility criterion for the two-dimensional Jacobian conjecture

From papers

Let R=C[x,y]\mathcal{R}=\mathbb{C}[x,y], and let N(F)N(F) denote the Newton polygon of FF. Let a,bZ>0a,b\in\mathbb{Z}_{>0} be relatively prime with 2a<b2\leq a<b. Suppose that F,GRF,G\in\mathcal{R} satisfy [F,G]C[F,G]\in\mathbb{C}, that

{(0,0),(0,1),(1,0)}N(F),\{(0,0),(0,1),(1,0)\}\subset N(F),

and that N(F)N(F) is similar to N(G)N(G) with the origin as center of similarity and ratio deg(F):deg(G)=a:b\deg(F):\deg(G)=a:b.

The Newton-polygon criterion. Then [F,G]=0[F,G]=0.

The source states this as an equivalent reformulation of a divisibility criterion for the Jacobian conjecture, using the similarity of augmented Newton polygons for Jacobian pairs. It is presented as an open conjectural route to the Jacobian conjecture.

Progress summary

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

Sources & referencesView supporting material

Primary source

Jacob Glidewell, William E. Hurst, Kyungyong Lee and Li Li, “On the two-dimensional Jacobian conjecture: Magnus' formula revisited, II”, arXiv:2205.12792 (2022).

Solutions 0

No solutions have been posted yet.