COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY
DOI10.1142/S0218196711006649zbMath1239.16026OpenAlexW2027459617MaRDI QIDQ3110890
Publication date: 16 January 2012
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196711006649
nil algebrasPI-algebrasrelatively free algebrasnilpotent quotient algorithmfinitely presented associative algebras
Symbolic computation and algebraic computation (68W30) Finite rings and finite-dimensional associative algebras (16P10) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Nil and nilpotent radicals, sets, ideals, associative rings (16N40) Computational aspects of associative rings (general theory) (16Z05) (T)-ideals, identities, varieties of associative rings and algebras (16R10)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- A nilpotent quotient algorithm for graded Lie rings
- Computing automorphism groups and testing isomorphisms for modular group algebras.
- An algorithm for computing graded algebras
- Bounds for indices of nilpotency and nility
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- SOME OPEN PROBLEMS IN THE THEORY OF INFINITE DIMENSIONAL ALGEBRAS
- Relatively Free Algebras with the Identityx3 = 0#
- On a problem of Kurosch and Jacobson
This page was built for publication: COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY