Non-commutative Computer Algebra for polynomial algebras: Gröbner bases, applications and implementation [PhD thesis]
✍ Scribed by Viktor Levandovskyy
- Publisher
- Technische Universität Kaiserslautern
- Year
- 2005
- Tongue
- English
- Leaves
- 264
- Category
- Library
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This book provides a comprehensive treatment of Gr bner bases theory embedded in an introduction to commutative algebra from a computational point of view. The centerpiece of Gr bner bases theory is the Buchberger algorithm, which provides a common generalization of the Euclidean algorithm and the G
<p>The origins of the mathematics in this book date back more than two thou sand years, as can be seen from the fact that one of the most important algorithms presented here bears the name of the Greek mathematician Eu clid. The word "algorithm" as well as the key word "algebra" in the title of th
<p><p>The main goal of this book is to find the constructive content hidden in abstract proofs of concrete theorems in Commutative Algebra, especially in well-known theorems concerning projective modules over polynomial rings (mainly the Quillen-Suslin theorem) and syzygies of multivariate polynomia