In 1983, T.T. Moh gave a computer-search algorithm to find the possible counter-example of Jacobian conjecture for polynomials of degree less than or equal to 100. His algorithm claimed that there are ...

Let F, G ∈ C [ x, y ]. If the Jacobian determinant of F and G is 1, then G is said to be a Jacobian mate of F. If, in addition, G has degree less than that of F, then G is said to be a younger mate of ...