Computing nilpotent quotients in finitely presented Lie rings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1997

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.
Fichier principal
Vignette du fichier
dm010101.pdf (86.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00955687 , version 1 (05-03-2014)

Identifiers

Cite

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

Collections

TDS-MACS
64 View
824 Download

Altmetric

Share

Gmail Facebook X LinkedIn More