Word problem for finitely presented metabelian Poisson algebras
Rings and Algebras
2019-07-16 v1
Abstract
We first construct a linear basis for a free metabelian Poisson algebra generated by an arbitrary well-ordered set. It turns out that such a linear basis depends on the characteristic of the underlying field. Then we elaborate the method of Gr\"{o}bner--Shirshov bases for metabelian Poisson algebras. Finally, we show that the word problem for finitely presented metabelian Poisson algebras are solvable.
Keywords
Cite
@article{arxiv.1907.05953,
title = {Word problem for finitely presented metabelian Poisson algebras},
author = {Zerui Zhang and Yuqun Chen and L. A. Bokut},
journal= {arXiv preprint arXiv:1907.05953},
year = {2019}
}
Comments
26 pages