Involutive Algorithms for Computing Groebner Bases
| dc.creator | Gerdt, Vladimir P. | |
| dc.date | 2005-01-08 | |
| dc.date.accessioned | 2026-07-07T05:15:55Z | |
| dc.date.available | 2026-07-07T05:15:55Z | |
| dc.description | In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain way. In the presented algorithm a reduced Groebner basis is the internally fixed subset of an involutive basis, and having computed the later, the former can be output without any extra computational costs. We also discuss some accounts of experimental superiority of the involutive algorithm over Buchberger's algorithm. | |
| dc.description | 27 pages, Proceedings of the NATO Advanced Research Workshop "Computational commutative and non-commutative algebraic geometry" (Chishinau, June 6-11, 2004), IOS Press, to appear | |
| dc.identifier | https://arxiv.org/abs/math/0501111 | |
| dc.identifier | http://arxiv.org/abs/math/0501111 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73797 | |
| dc.subject | Commutative Algebra | |
| dc.subject | Algebraic Geometry | |
| dc.subject | 13P10; 68W30 | |
| dc.title | Involutive Algorithms for Computing Groebner Bases | |
| dc.type | text |