Noncommutative Polynomial Algebras of Solvable Type and Their Modules - Basic Constructive-Computational Theory and Methods (Hardcover)

Noncommutative Polynomial Algebras of Solvable Type and Their Modules is the first 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 Groebner basis theory for left ideals of solvable polynomial algebras and submodules of free modules The new filtered-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 Groebner basis techniques with the use of Gelfand-Kirillov dimension, and the construction of different kinds of elimination orderings The computational construction of finite free resolutions (including computation of syzygies, construction of different kinds of finite minimal free resolutions based on computation of different 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.

General

Imprint:	Taylor & Francis
Country of origin:	United Kingdom
Series:	Chapman & Hall/CRC Monographs and Research Notes in Mathematics
Release date:	November 2021
First published:	2022
Authors:	Huishi Li
Dimensions:	234 x 156 x 21mm (L x W x T)
Format:	Hardcover
Pages:	218
ISBN-13:	978-1-03-207988-2
Categories:	Books > Science & Mathematics > Mathematics > Algebra > General Promotions
LSN:	1-03-207988-6
Barcode:	9781032079882

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!