An Involutive GVW Algorithm and the Computation of Pommaret Bases
Date
2021-06-07Author
Robertz, Daniel
Hashemi, A
Izgin, T
Seiler, WM
Metadata
Show full item recordAbstract
The GVW algorithm computes simultaneously Gröbner bases of a given ideal and of the syzygy module of the given generating set. In this work, we discuss an extension of it to involutive bases. Pommaret bases play here a special role in several respects. We distinguish between a fully involutive GVW algorithm which determines involutive bases for both the given ideal and the syzygy module and a semi-involutive version which computes for the syzygy module only an ordinary Gröbner basis. A prototype implementation of the developed algorithms in Maple is described.
Collections
Publisher
Springer Verlag
Journal
Mathematics in Computer Science
Volume
15
Issue
3
Pagination
419-452
Recommended, similar items
The following license files are associated with this item: