dpgb

Improving the DISPGB algorithm using the discriminant ideal. In this paper we use Weispfenning’s CCGB ideas to make substantial improvements on Montes’ DISPGB algorithm. It now includes rewriting of the discussion tree using the discriminant ideal and provides a compact and effective discussion. We also describe the new algorithms in the DPGB library containing the improved DISPGB as well as new routines for checking whether a given basis is a CGB or not, and for obtaining a CGB. Examples and tests are also provided.