Algorithmic problems for solvable Lie algebras (Q1145202)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3695427
Language Label Description Also known as
default for all languages
No label defined
    English
    Algorithmic problems for solvable Lie algebras
    scientific article; zbMATH DE number 3695427

      Statements

      Algorithmic problems for solvable Lie algebras (English)
      0 references
      0 references
      1979
      0 references
      It is proved that any variety \(\mathfrak M\) of Lie algebras which contains the variety \(\mathfrak N_2\mathfrak A\), has the unsolvable word problem. This result is more general than the theorem of the reviewer about unsolvability of the word problem for the class of all Lie algebras [see Izv. Akad. Nauk SSSR, Ser. Mat. 36, 1173--1219 (1972; Zbl 0252.02046)] and gives the positive answer to the well-known problem of \textit{A. I. Shirshov} [see Dnestr Notebook, Novosibirsk, 1976, problem No. 155] about unsolvability of the word problem for the \(n\)-solvable Lie algebra, \(n\ge 3\).
      0 references
      variety of Lie algebras
      0 references
      unsolvable word problem
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references