Authors: Huishi Li
Keywords: PBW basis, Monomial ordering, GrÄobner basis, Solvable polynomial algebra.
Abstract
In terms of their defining relations, solvable polynomial algebras introduced by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)] are characterized by employing Gröobner bases of ideals in free algebras, thereby solvable polynomial algebras are completely determinable and constructible in a computational way.
Department of Applied Mathematics,
College of Information Science and Technology
Hainan University, Haikou 570228, China
E-mail:
Fulltext
–
0.17 Mb