arXiv · 1708.07936
Some algorithms related to the Jacobian Conjecture
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 $\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.
Explore related subjects
Keep this discovery
Jorge A. Guccione, Juan J. Guccione, Rodrigo Horruitiner, Christian Valqui. 2017-08-26. Some algorithms related to the Jacobian Conjecture. https://arxiv.org/abs/1708.07936
Cite the original work for its findings. Save a collection to share your selection of sources.