English

Some algorithms related to the Jacobian Conjecture

Commutative Algebra 2017-08-29 v1 Algebraic Geometry

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))35\gcd(deg(P),deg(Q))\le 35, and all the pairs (deg(P),deg(Q))(deg(P),deg(Q)) with max(deg(P),deg(Q))150\max(deg(P),deg(Q))\le 150 for any hypothetical counterexample.

Keywords

Cite

@article{arxiv.1708.07936,
  title  = {Some algorithms related to the Jacobian Conjecture},
  author = {Jorge A. Guccione and Juan J. Guccione and Rodrigo Horruitiner and Christian Valqui},
  journal= {arXiv preprint arXiv:1708.07936},
  year   = {2017}
}

Comments

29 pages, 6 tables, 9 algorithms

R2 v1 2026-06-22T21:24:08.676Z