Efficiently Computing Minimal Sets of Critical Pairs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In the computation of a Gr"obner basis using Buchberger's algorithm, a key issue for improving the efficiency is to produce techniques for avoiding as many unnecessary critical pairs as possible. A good solution would be to avoid _all_ non-minimal critical pairs, and hence to process only a_minimal_ set of generators of the module generated by the critical syzygies. In this paper we show how to obtain that desired solution in the homogeneous case while retaining the same efficiency as with the classical implementation. As a consequence, we get a new Optimized Buchberger Algorithm.
LaTeX using elsart.cls, 27 pages

Keywords

Commutative Algebra, 14P10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/68794

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0310130
 http://arxiv.org/abs/math/0310130

Collections

arXiv