An algorithm for computing graded algebras

DOI10.1006/jsco.1993.1052zbMath0801.16025OpenAlexW1979137832MaRDI QIDQ1318850

Michael Vaughan-Lee

Publication date: 1 December 1994

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1993.1052

zbMATH Keywords

algorithmgeneratorsgraded algebrasNagata-Higman theorempartial linearizationsordered basisdegree of nilpotencyhomogeneous relationsweighted product presentation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite rings and finite-dimensional associative algebras (16P10) Graded rings and modules (associative rings and algebras) (16W50) Computational aspects of associative rings (general theory) (16Z05) Nonassociative algebras satisfying other identities (17A30) Identities other than those of matrices over commutative rings (16R40)

Related Items

The Algebra of Invariants of 3 × 3 Matrices Over a Field of Arbitrary Characteristic ⋮ Köthe's problem, Kurosh-Levitzky problem and graded rings ⋮ Generating sets for coordinate rings of character varieties ⋮ On the nilpotency degree of the algebra with identity \(x^n=0\). ⋮ Superalgebras and Dimensions of Algebras ⋮ Relatively Free Algebras with the Identityx³ = 0^# ⋮ Defining relations of minimal degree of the trace algebra of \(3\times 3\) matrices. ⋮ The Free Alternative Nil-Superalgebra of Index n on One Odd Generator ⋮ ASSOCIATIVE NIL-ALGEBRAS OVER FINITE FIELDS ⋮ COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY ⋮ The ring of generic matrices.

This page was built for publication: An algorithm for computing graded algebras