2007/05/17 by Moulay A. Barkatou, Barkatou, Moulay A., Hassan El Houari +5
Computer Science · Mathematics · #13P10 #14R10 #Advanced Topics in Algebra #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Coding theory and cryptography #Commutative Algebra (math.AC) #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Rings, Modules, and Algebras #math.AC #math.AG #msc:13P10 #msc:14R10
paper · pdf · doi:10.48550/arxiv.0705.2489
9 pages; Maple implementation available under request
arxiv created 2007/05/17 · openalex publication_date 2007/05/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
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.