Noncommutative polynomial algebras of solvable type and their modules: basic constructive-computational theory and methods (1st)

Noncommutative Polynomial Algebras of Solvable Type and Their Modules is the ?rst book to systematically introduce the basic constructive-computational theory and methods developed for investigating solvable polynomial algebras and their modules. In doing so, this book covers:

• A constructive introduction to solvable polynomial algebras and Gröbner basis theory for left ideals of solvable polynomial algebras and submodules of free modules
• The new ?ltered-graded techniques combined with the determination of the existence of graded monomial orderings
• The elimination theory and methods (for left ideals and submodules of free modules) combining the Gröbner basis techniques with the use of Gelfand-Kirillov dimension, and the construction of di?erent kinds of elimination orderings
• The computational construction of ?nite free resolutions (including computation of syzygies, construction of di?erent kinds of ?nite minimal free resolutions based on computation of di?erent kinds of minimal generating sets), etc.

This book is perfectly suited to researchers and postgraduates researching noncommutative computational algebra and would also be an ideal resource for teaching an advanced lecture course.