paper

Characterization of rank two locally nilpotent derivations in dimension three

arXiv:0705.2489

Abstract

In this paper we give an algorithmic characterization of rank two locally nilpotent derivations in dimension three. Together with an algorithm for computing the plinth ideal, this gives a method for computing the rank of a locally nilpotent derivation in dimension three.

9 pages; Maple implementation available under request

Characterization of rank two locally nilpotent derivations in dimension three · wovepaper