Article collection "Mathematical Problems of Cybernetics" №11, Moscow, 2002

Authors:Latyshev V.N.

The algorithmic recognition of polynomial identities

Abstract:

he factor-algebras A\I are regarded where A is a free associative algebra the universally enveloping algebra of a finitely dimential Lie algebra over a field
of zero characteristic and I an ideal of A generated by a finite Groebner-Shirshov basis. It is proved that the property of A\I to by Lie nilpotent algebra(with a fixed index) is
algorithmically recognizable.

Keywords:

recognizable properties of algebras, polynomial identities, universally enveloping algebras of the finitely dimential Lie algebras

Publication language:russian, pages:10 (p. 5-14)

Research direction:

Mathematical problems and theory of numerical methods