Some algorithms related to the Jacobian Conjecture

Jorge A. Guccione; Juan J. Guccione; Rodrigo Horruitiner; Christian Valqui

paper

Some algorithms related to the Jacobian Conjecture

arXiv:1708.07936

Abstract

We describe an algorithm that computes possible corners of hypothetical counterexamples to the Jacobian Conjecture up to a given bound. Using this algorithm we compute the possible families corresponding to $g cd (d e g (P), d e g (Q)) \leq 35$ , and all the pairs $(d e g (P), d e g (Q))$ with $max (d e g (P), d e g (Q)) \leq 150$ for any hypothetical counterexample.

29 pages, 6 tables, 9 algorithms