eng
episciences.org
Discrete Mathematics & Theoretical Computer Science
1365-8050
1997-01-01
Vol. 1
10.46298/dmtcs.234
234
journal article
Computing nilpotent quotients in finitely presented Lie rings
Csaba Schneider
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.
https://dmtcs.episciences.org/234/pdf
nilpotent presentation
Lie rings
nilpotent Lie rings
finitely presented Lie rings
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]