Algorithmic problems in associative algebras

DOI10.1007/BF02261749MaRDI QIDQ1346910zbMATH OpenOpenAlexFDO

Authors Ualbai 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 dependencealgorithmic problemsfree algebrasoccurrence problemrelation modulestwo-tape Minsky machinesundecidability resultsundecidable word problemvariety of algebras

Mathematics Subject Classification ID

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

Review text

The author proves that the occurrence problem for free algebras in the variety of algebras obeying the identity \([x_1,x_2][x_3,x_4][x_5,x_6][x_7,x_8]=0\) is undecidable. The next result is that there is no algorithm determining whether or not a finite system of elements in a free associative algebra is algebraically dependent. And the last result is that there exists a f.g. associative algebra with undecidable word problem, such that its relation module is free. These undecidability results are proven by interpretation of two-tape Minsky machines. In the proof of the second result the cycles in these machines are studied and interpreted as dependences in algebras.

Recommendations

• ALGORITHMIC PROBLEMS IN VARIETIES
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. III
• Algorithmic problems for differential polynomial algebras
• scientific article; zbMATH DE number 4136145
• On some algorithmic problems related to varieties of nonassociative rings

Cites work

• scientific article; zbMATH DE number 4107068 (Why is no real title available?)
• scientific article; zbMATH DE number 3719308 (Why is no real title available?)
• scientific article; zbMATH DE number 3627285 (Why is no real title available?)
• scientific article; zbMATH DE number 599462 (Why is no real title available?)
• scientific article; zbMATH DE number 3231085 (Why is no real title available?)
• scientific article; zbMATH DE number 3082632 (Why is no real title available?)
• On the cohomology groups of an associative algebra
• Subalgebras of Free Associative Algebras
• 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

Cited in

(20)

• Primitive elements of free nonassociative algebras
• Investigations on algorithmic questions of algebra
• On some algorithmic problems related to varieties of nonassociative rings
• Graded algebras and their differential graded extensions.
• Recognition of certain properties of automaton algebras.
• Algorithmic problems for differential polynomial algebras
• On some algorithmic problems related to varieties of nonassociative rings
• scientific article; zbMATH DE number 7295748 (Why is no real title available?)
• Centralizers in free Poisson algebras
• scientific article; zbMATH DE number 4085079 (Why is no real title available?)
• Systems of linear equations over associative algebras and the occurrence problem for lie algebras
• Universal enveloping algebras and universal derivations of Poisson algebras
• Subalgebras of free algebras
• Algorithmic problems for free Poisson algebras
• Ualbai Utmakhanbetovich Umirbaev
• Gröbner-Shirshov bases and their calculation
• Filtrations and distortion in infinite-dimensional algebras.
• The XL-Algorithm and a Conjecture from Commutative Algebra
• Differential algebraic dependence and Novikov dependence
• Algebras with dimension

This page was built for publication: Algorithmic problems in associative algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1346910)