A Constructive Characterization of Solvable Polynomial Algebras
Rings and Algebras
2013-01-08 v2
Abstract
For the solvable polynomial algebras introduced and studied by Kandri-Rody and Weispfenning [J. Symbolic Comput., 9(1990)], a constructive characterization is given in terms of Gr\"obner bases for ideals of free algebras, thereby solvable polynomial algebras are completely determinable in a computational way.
Cite
@article{arxiv.1212.5988,
title = {A Constructive Characterization of Solvable Polynomial Algebras},
author = {Huishi Li},
journal= {arXiv preprint arXiv:1212.5988},
year = {2013}
}
Comments
12 pages with minor changes in Theorem 2.5 and its proof