Event № 502
Sample constructions of two algebras, both with the ideal of relations defined by a finite Groebner basis will be presented. For the first algebra the question whether a given element is nilpotent is algorithmically unsolvable, for the second the question whether a given element is a zero divisor is algorithmically unsolvable. This gives a negative answer to questions raised by Latyshev.
Joint work with Ilya Ivanov-Pogodaev.