Corpus ID: 10410397

Computing nilpotent quotients in finitely presented Lie rings

@article{Schneider1997ComputingNQ,
  title={Computing nilpotent quotients in finitely presented Lie rings},
  author={C. Schneider},
  journal={Discret. Math. Theor. Comput. Sci.},
  year={1997},
  volume={1},
  pages={1-16}
}

C. Schneider

Published 1997

Mathematics, Computer Science

Discret. Math. Theor. Comput. Sci.

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed