Abstract
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.
DOI
10.1007/s11786-021-00512-5
Publication Date
2021-06-07
Publication Title
Mathematics in Computer Science
Publisher
Springer Verlag
ISSN
1661-8270
Embargo Period
2024-11-22
Recommended Citation
Robertz, D., Hashemi, A., Izgin, T., & Seiler, W. (2021) 'An Involutive GVW Algorithm and the Computation of Pommaret Bases', Mathematics in Computer Science, . Springer Verlag: Available at: https://doi.org/10.1007/s11786-021-00512-5
