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

Buy Nurture Tokens

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)
Category

Mathematics - Rings and Algebras

Subcategories
-
Ask The Authors

Ask the authors of this paper a question or leave a comment.

Read it. Rate it.
#1. Which part of the paper did you read?

#2. The paper contains new data or analyses that is openly accessible?
#3. The conclusion is supported by the data and analyses?
#4. The conclusion is of scientific interest?
#5. The result is likely to lead to future research?

Github
User:
None (add)
Repo:
None (add)
Stargazers:
0
Forks:
0
Open Issues:
0
Network:
0
Subscribers:
0
Language:
None
Youtube
Link:
None (add)
Views:
0
Likes:
0
Dislikes:
0
Favorites:
0
Comments:
0
Other
Sample Sizes (N=):
Inserted:
Words Total:
Words Unique:
Source:
Abstract:
None
07/15/19 06:08PM
14,419
1,628
Tweets
Nobody has tweeted about this paper.
Images
Related