Algorithmic problems in associative algebras

DOI10.1007/BF02261749zbMath0851.16023OpenAlexW2026893279MaRDI 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 dependencefree algebrasrelation modulesvariety of algebrasundecidability resultsalgorithmic problemsundecidable word problemoccurrence problemtwo-tape Minsky machines

Mathematics Subject Classification ID

Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) (T)-ideals, identities, varieties of associative rings and algebras (16R10)

Related Items

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