Some algorithms related to the Jacobian Conjecture
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.
Authors
- Juan J. Guccione (ORCID: https://orcid.org/0000-0002-3403-2348)
- Rodrigo Horruitiner (ORCID: https://orcid.org/0000-0002-3430-7612)
- Jorge A. Guccione (ORCID: https://orcid.org/0000-0001-8838-3533)
- Christian Valqui (ORCID: https://orcid.org/0000-0003-2716-3830)
Institutions
- Cornell University (US)
- Pontificia Universidad Católica del Perú (PE)
Publication Details
- Journal
- Pro mathematica.
- Published
- 2026-11-17
- DOI
- https://doi.org/10.18800/promathematica.202501.003
- Citations
- 4
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Consejo Nacional de Investigaciones Científicas y Técnicas
- Pontificia Universidad Católica del Perú
- Secretaria de Ciencia y Tecnica, Universidad de Buenos Aires