Computing Nilpotent Quotients in Finitely Presented Lie Rings

Details Computing Nilpotent Quotients in Finitely Presented Lie Rings Computing Nilpotent Quotients in Finitely Presented Lie Rings

1996-04-20

arxiv.org/abs/math/9604206v1

Mathematics

Group Theory

DVI and Post-Script files only

Scientific paper

A nilpotent quotient algorithm for finitely presented Lie rings over Z (LieNQ) is described. The paper studies graded and non-graded cases separately. The algorithm computes the so-called nilpotent presentation for a finitely presented, nilpotent Lie ring. The nilpotent presentation consists of generators for the abelian group and the products---expressed as linear combinations---for pairs formed by generators. Using that presentation the word problem is decidable in $L$. Provided that the Lie ring $L$ is graded, it is possible to determine the canonical presentation for a lower central factor of $L$. LieNQ's complexity is studied and it is shown that optimizing the presentation is NP-hard. Computational details are provided with examples, timing and some structure theorems obtained from computations. Implementation in C and GAP 3.5 interface is available.

Affiliated with

Also associated with

No associations

Rating

Computing Nilpotent Quotients in Finitely Presented Lie Rings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Nilpotent Quotients in Finitely Presented Lie Rings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Nilpotent Quotients in Finitely Presented Lie Rings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604904