Computing nilpotent quotients in finitely presented Lie rings
A nilpotent quotient algorithm for finitely presented Lie rings over Z (and Q) 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 consist...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
1997-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/73 |
| id |
doaj-0a1df08dec724ad599915c87c840adb8 |
|---|---|
| record_format |
Article |
| spelling |
doaj-0a1df08dec724ad599915c87c840adb82020-11-24T21:04:05ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1462-72641365-80501997-12-0111Computing nilpotent quotients in finitely presented Lie ringsCsaba SchneiderA nilpotent quotient algorithm for finitely presented Lie rings over Z (and Q) 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. http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/73 |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Csaba Schneider |
| spellingShingle |
Csaba Schneider Computing nilpotent quotients in finitely presented Lie rings Discrete Mathematics & Theoretical Computer Science |
| author_facet |
Csaba Schneider |
| author_sort |
Csaba Schneider |
| title |
Computing nilpotent quotients in finitely presented Lie rings |
| title_short |
Computing nilpotent quotients in finitely presented Lie rings |
| title_full |
Computing nilpotent quotients in finitely presented Lie rings |
| title_fullStr |
Computing nilpotent quotients in finitely presented Lie rings |
| title_full_unstemmed |
Computing nilpotent quotients in finitely presented Lie rings |
| title_sort |
computing nilpotent quotients in finitely presented lie rings |
| publisher |
Discrete Mathematics & Theoretical Computer Science |
| series |
Discrete Mathematics & Theoretical Computer Science |
| issn |
1462-7264 1365-8050 |
| publishDate |
1997-12-01 |
| description |
A nilpotent quotient algorithm for finitely presented Lie rings over Z (and Q) 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. |
| url |
http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/73 |
| work_keys_str_mv |
AT csabaschneider computingnilpotentquotientsinfinitelypresentedlierings |
| _version_ |
1716772040566898688 |