Jorge A. Guccione, Juan J. Guccione, Rodrigo Horruitiner, Christian Valqui
Published 2017-08-26Version 1
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 $\gcd(deg(P),deg(Q))\le 35$, and all the pairs $(deg(P),deg(Q))$ with $\max(deg(P),deg(Q))\le 150$ for any hypothetical counterexample.
Comments: 29 pages, 6 tables, 9 algorithms
An approach to the Jacobian Conjecture in terms of irreducibility
On the shape of possible counterexamples to the Jacobian Conjecture
An effective approach to Picard-Vessiot theory and the Jacobian Conjecture
![QR code for arXiv:1708.07936 [math.AC]](http://oss.arxitics.com/images/favicon.svg)