Reducing the size and number of linear programs in a dynamic Gr\"obner basis algorithm
Commutative Algebra
2014-02-18 v3 Symbolic Computation
Abstract
The dynamic algorithm to compute a Gr\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first glance, the added overhead seems to outweigh the benefit; the algorithm must solve many linear programs with many linear constraints. This paper describes two methods of reducing the cost substantially, answering the problem effectively.
Cite
@article{arxiv.1209.2379,
title = {Reducing the size and number of linear programs in a dynamic Gr\"obner basis algorithm},
author = {Massimo Caboara and John Perry},
journal= {arXiv preprint arXiv:1209.2379},
year = {2014}
}
Comments
11 figures, of which half are algorithms; submitted to journal for refereeing, December 2012