Skip to Main content Skip to Navigation
Journal articles

Computing nilpotent quotients in finitely presented Lie rings

Abstract : A nilpotent quotient algorithm for finitely presented Lie rings over \textbfZ (and \textbfQ) is described. The paper studies the graded and non-graded cases separately. The algorithm computes the so-called nilpotent presentation for a finitely presented, nilpotent Lie ring. A 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. Complexity is studied and it is shown that optimising the presentation is NP-hard. Computational details are provided with examples, timing and some structure theorems obtained from computations. Implementation in C and GAP interface are available.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Alain Monteil Connect in order to contact the contributor
Submitted on : Wednesday, March 5, 2014 - 9:30:26 AM
Last modification on : Wednesday, November 29, 2017 - 10:26:24 AM
Long-term archiving on: : Thursday, June 5, 2014 - 10:51:46 AM


Files produced by the author(s)




Csaba Schneider. Computing nilpotent quotients in finitely presented Lie rings. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1997, Vol. 1, pp.1-16. ⟨10.46298/dmtcs.234⟩. ⟨hal-00955687⟩



Record views


Files downloads