An algorithm for computing graded algebras

DOI10.1006/jsco.1993.1052zbMath0801.16025MaRDI 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

algorithm; generators; graded algebras; Nagata-Higman theorem; partial linearizations; ordered basis; degree of nilpotency; homogeneous relations; weighted product presentation

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

16P10: Finite rings and finite-dimensional associative algebras

16W50: Graded rings and modules (associative rings and algebras)

16Z05: Computational aspects of associative rings (general theory)

17A30: Nonassociative algebras satisfying other identities

16R40: Identities other than those of matrices over commutative rings

Related Items

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