In this paper we address the basic problem of computing minimal finite free resolutions of homogeneous submodules of graded free modules over polynomial rings. We develop a strategy, which keeps the resolution minimal at every step. Among the relevant benefits is a marked saving of time, as the firs
Computing Parametric Geometric Resolutions
✍ Scribed by Éric Schost
- Book ID
- 105867364
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 308 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0938-1279
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In the present paper we study algorithms based on the theory of Gröbner bases for computing free resolutions of modules over polynomial rings. We propose a technique which consists in the application of special selection strategies to the Schreyer algorithm. The resulting algorithm is efficient and,
The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive m
The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive m