A Note on Solvable Polynomial Algebras
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 const...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2014-03-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v22-n1/v22-n1-(pp99-109).pdf |
id |
doaj-6957d408eeea4de5a844b52dc6cb1ec2 |
---|---|
record_format |
Article |
spelling |
doaj-6957d408eeea4de5a844b52dc6cb1ec22020-11-24T22:55:08ZengInstitute of Mathematics and Computer Science of the Academy of Sciences of MoldovaComputer Science Journal of Moldova1561-40422014-03-01221(64)99109A Note on Solvable Polynomial AlgebrasHuishi Li0Department of Applied Mathematics, College of Information Science and Technology, Hainan University, Haikou 570228, ChinaIn 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.http://www.math.md/files/csjm/v22-n1/v22-n1-(pp99-109).pdfPBW basisMonomial orderingGr\"obner basisSolvable polynomial algebra |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Huishi Li |
spellingShingle |
Huishi Li A Note on Solvable Polynomial Algebras Computer Science Journal of Moldova PBW basis Monomial ordering Gr\"obner basis Solvable polynomial algebra |
author_facet |
Huishi Li |
author_sort |
Huishi Li |
title |
A Note on Solvable Polynomial Algebras |
title_short |
A Note on Solvable Polynomial Algebras |
title_full |
A Note on Solvable Polynomial Algebras |
title_fullStr |
A Note on Solvable Polynomial Algebras |
title_full_unstemmed |
A Note on Solvable Polynomial Algebras |
title_sort |
note on solvable polynomial algebras |
publisher |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova |
series |
Computer Science Journal of Moldova |
issn |
1561-4042 |
publishDate |
2014-03-01 |
description |
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. |
topic |
PBW basis Monomial ordering Gr\"obner basis Solvable polynomial algebra |
url |
http://www.math.md/files/csjm/v22-n1/v22-n1-(pp99-109).pdf |
work_keys_str_mv |
AT huishili anoteonsolvablepolynomialalgebras AT huishili noteonsolvablepolynomialalgebras |
_version_ |
1725657827986374656 |