An algorithm for computing the kernel of a locally finite iterative higher derivation (Q932298)

Let \(R\) be a principal ideal domain (abbreviated as PID) and \(A\) an \(R\)-algebra finitely generated. Let \(D=\{D_n\}_{n\geq 0}\) be a locally finite iterative higher derivation (abbreviated as lfihd) of \(A\) and \(A^D=\{a\in A : D_n(a)=0\) for all \(n\geq 1\}\) the kernel of \(D\). Tanimoto gives an algorithm for computing \(A^D\). \textit{A. van den Essen} [Polynomial Automorphisms and the Jacobian Conjecture. Progress in Mathematics (Boston, Mass.). 190. (Basel): Birkhäuser. (2000; Zbl 0962.14037)] solved the problem to determine the kernel \(A^D\) of \(D\), when \(R\) is a field of characteristic \(0\), \textit{S.-I. Okuda} in [Hiroshima Math. J. 34, No. 1, 1--19 (2004; Zbl 1057.13016)] solved the analogue problem when \(R\) is a field of positive characteristic and there exists an element \(s\in A\) such that \(D_1(s)=1\) and \textit{C. Sancho de Salas} [Proc. Lond. Math. Soc. (3) 81 (2), 387--404 (2000; Zbl 1024.14021)] solved it when \(R\) is an algebraically closed field of arbitrary characteristic. Tanimoto in the present paper describes the Diximier operator over a commutative ring, gives an algorithm for computing a local slice of a given non-trivial lfihd and following the technique of Van den Essen gives an algorithm for computing the kernel of a lfihd of a finitely generated \(R\)-domain, where \(R\) is a PID. As an application the author studies the kernel of a linear lfihd of the polynomial ring in three variables over an algebraically closed field of positive characteristic.