On the Jacobian conjecture: A new approach via Gröbner bases (Q584328): Difference between revisions

A Gröbner basis for an ideal of a polynomial ring over a field is a set of generators with many useful computational properties [see e.g. \textit{B. Buchberger} in Multidimensional systems theory, D. Reidel Publ. Co. 16, 184-232 (1985; Zbl 0587.13009)]. The present authors define this notion over general commutative rings and discuss the construction when coefficient rings are affine algebras over fields. These results allow to extend an unpublished criterion of \(van\quad den\quad Essen\) for a polynomial map to be polynomially invertible. In this setting, the Jacobian conjecture is reduced to certain problems in the complexity theory of Gröbner bases. The paper contains examples which show it is too much to hope for a universal bound of degrees of Gröbner bases over an affine ring. This contrasts with the case of polynomial rings over a field [cf. \textit{V. Weispfenning} in Applicable algebra, error-correcting codes, combinatorics and computer algebra, Lect. Notes Comput. Sci. 307, 195-201 (1988; Zbl 0655.13018)].