Algorithmic problems in associative algebras

DOI10.1007/BF02261749zbMath0851.16023MaRDI QIDQ1346910

Ualbei Utmakhanbetovich Umirbaev

Publication date: 20 April 1995

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187658

zbMATH Keywords

algebraic dependence; free algebras; relation modules; variety of algebras; undecidability results; algorithmic problems; undecidable word problem; occurrence problem; two-tape Minsky machines

Mathematics Subject Classification ID

16S15: Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting)

16R10: (T)-ideals, identities, varieties of associative rings and algebras

Related Items

Subalgebras of free algebras, Ualbai Utmakhanbetovich Umirbaev, Gröbner–Shirshov bases and their calculation, Differential algebraic dependence and Novikov dependence, Algorithmic problems for differential polynomial algebras, Universal enveloping algebras and universal derivations of Poisson algebras, Filtrations and distortion in infinite-dimensional algebras., Primitive elements of free nonassociative algebras, Graded algebras and their differential graded extensions., Recognition of certain properties of automaton algebras., Centralizers in free Poisson algebras

Cites Work

• The equality problem and free products of Lie algebras and of associative algebras
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
• On the cohomology groups of an associative algebra
• Subalgebras of Free Associative Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item