Some algorithms related to the Jacobian Conjecture
Pro Mathematica · 17.11.2026 · 33 (66) · 58-110
DOI: 10.18800/promathematica.202501.003 ↗Kurz gefasst
Fachartikel in der Zeitschrift Pro Mathematica, online erschienen am 17.11.2026. Verfasst von Jorge A. Guccione und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
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.
Zitieren
APA
Guccione, J. A., Guccione, J. J., Horruitiner, R., & Valqui, C. (2026). Some algorithms related to the Jacobian Conjecture. Pro Mathematica, 33(66), 58-110. https://doi.org/10.18800/promathematica.202501.003
Vancouver
Guccione JA, Guccione JJ, Horruitiner R, Valqui C. Some algorithms related to the Jacobian Conjecture. Pro Mathematica. 2026;33(66):58-110. doi:10.18800/promathematica.202501.003
BibTeX
@article{Guccione2026,
author = {Guccione, Jorge A. and Guccione, Juan J. and Horruitiner, Rodrigo and Valqui, Christian},
title = {Some algorithms related to the Jacobian Conjecture},
journal = {Pro Mathematica},
year = {2026},
volume = {33},
number = {66},
pages = {58--110},
doi = {10.18800/promathematica.202501.003}
}
EUVIMED