An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
From MaRDI portal
Publication:914800
DOI10.1016/S0747-7171(08)80004-1zbMath0702.16011MaRDI QIDQ914800
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
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) Computational aspects of associative rings (general theory) (16Z05)
Related Items
A note on applications of the `Vector Enumerator' algorithm. ⋮ The Big Mother of all Dualities: Möller Algorithm ⋮ Termination for a class of algorithms for constructing algebras given by generators and relations ⋮ Constructing irreducible representations of finitely presented algebras ⋮ Computing Gröbner bases by FGLM techniques in a non-commutative setting ⋮ On vector enumeration
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the solution of matrix equations. Example: Application to invariant equations
- Non-commutative Gröbner bases in algebras of solvable type
- An extension of Buchberger's algorithm and calculations in enveloping fields of Lie algebras
- The diamond lemma for ring theory
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Resolution of singularities of an algebraic variety over a field of characteristic zero. I
- Algorithm 628
- Report on a program for solving polynomial equations in non-commuting variables
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Computation and simplification in lie fields
- A practical method for enumerating cosets of a finite abstract group
