2007•arXiv (Cornell University)Open access

Characterization of rank two locally nilpotent derivations in dimension\n three

Moulay A. Barkatou, Hassan El Houari, M’hammed El Kahoui

Abstract

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

Open-access reader

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Rank (graph theory), Dimension (graph theory), Nilpotent, Mathematics, Characterization (materials science), Ideal (ethics), Locally nilpotent, Pure mathematics