Some new theoretical and computational results around the Jacobian conjecture

In this paper, we study a so-called Condition C1 on square matrices with complex coefficients and a weaker Condition C2. For Druzkowski maps Condition C2 is equivalent to the Jacobian conjecture. We show that these conditions satisfy many good properties and in particular are satisfied by a dense subset of the set of square matrices of a given rank [Formula: see text]. Based on this, we propose a heuristic argument for the truth of the Jacobian conjecture. We propose some new equivalent formulations and some generalizations of the Jacobian conjecture, and some approaches (including computer algebra and numerical methods) toward resolving it. We show that some of these equivalent formulations are automatically satisfied by generic Druzkowski matrices. Applications and experimental results are included