A Constructive Characterization of Solvable Polynomial Algebras

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öbner bases for ideals of free algebras, thereby solvable polynomial algebras are completely determinable in a computational way.

12 pages with minor changes in Theorem 2.5 and its proof

Cited by in corpus (4)

• Computation of Minimal Filtered Free Resolutions over $\mathbb{N}$-Filtered Solvable Polynomial Algebras
• Computation of Minimal Graded Free Resolutions over $\mathbb{N}$-Graded Solvable Polynomial Algebras
• An Elimination Lemma for Algebras with PBW Bases
• Notes on Gröbner Bases and Free Resolutions of Modules over Solvable Polynomial Algebras