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 (deg(P),deg(Q)) 35, and all the pairs (deg(P),deg(Q)) with (deg(P),deg(Q)) 150 for any hypothetical counterexample.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.