The word problem for finitely presented metabelian Poisson algebras is solvable via a characteristic-dependent linear basis and Gröbner-Shirshov bases.
Buchberger, An algorithm for finding the basis element s of the residue class ring of a zero dimensional polynomial ideal, Translated from the 1965 German original by Michael P
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.RA 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Word problem for finitely presented metabelian Poisson algebras
The word problem for finitely presented metabelian Poisson algebras is solvable via a characteristic-dependent linear basis and Gröbner-Shirshov bases.