Word problem for finitely presented metabelian Poisson algebras
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.
NurtureToken New!
Token crowdsale for this paper ends in
Authors
Are you an author of this paper? Check the Twitter handle we have for you is correct.
| Zerui Zhang | (add twitter) | |
| Yuqun Chen | (add twitter) | |
| L. A. Bokut | (add twitter) |
Ask The Authors
Ask the authors of this paper a question or leave a comment.
Read it. Rate it.
Github
User:
None
(add)
Repo:
None
(add)
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
Tweets
Nobody has tweeted about this paper.
Images
Related
