Some algorithms related to the Jacobian Conjecture
Year: 2026
Type: article
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, and all the pairs (deg(P ), deg(Q)) with m´ax(deg(P ), deg(Q)) ≤ 150 for any hypothetical counterexample.
Source: Pro mathematica.
Institutions: Pontificia Universidad Católica del Perú, Cornell University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W2751910890
