A Constructive Characterization of Solvable Polynomial Algebras

2012/12/25 by Huishi Li, Li, Huishi · 2 citations
Computer Science · Mathematics · #16Z05 #68W30 #Advanced Differential Equations and Dynamical Systems #Commutative Algebra and Its Applications #FOS: Mathematics #Polynomial and algebraic computation #Rings and Algebras (math.RA)

paper · pdf · doi:10.48550/arxiv.1212.5988

openalex publication_date 2012/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Cited by

• An Elimination Lemma for Algebras with PBW Bases
• Computation of Minimal Graded Free Resolutions over ℕ-Graded Solvable Polynomial Algebras

Related

• Elimination Theory for Solvable Polynomial Algebras and Their Free Modules
• Notes on Gröbner Bases and Free Resolutions of Modules over Solvable Polynomial Algebras
• Computation of Minimal Graded Free Resolutions over ℕ-Graded Solvable Polynomial Algebras
• Computation of Minimal Filtered Free Resolutions over ℕ-Filtered Solvable Polynomial Algebras
• Degree Bounds for Gröbner Bases in Algebras of Solvable Type