Elimination Theory for Solvable Polynomial Algebras and Their Free Modules
Huishi Li

TL;DR
This paper develops an elimination theory for solvable polynomial algebras and their free modules using Gr"obner basis techniques, enabling systematic handling of left ideals and submodules.
Contribution
It introduces a novel elimination framework for left ideals and submodules in solvable polynomial algebras based on Gr"obner basis theory.
Findings
Established elimination theory for left ideals in solvable polynomial algebras.
Developed elimination methods for submodules of free modules over these algebras.
Extended Gr"obner basis techniques to facilitate ideal and submodule elimination.
Abstract
Let be a field, and a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for and for free modules over , an elimination theory for left ideals of and an elimination theory for submodules of free -modules are established.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Advanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation
