John Perry, University of Southern Mississippi, The dynamic approach to Gröbner basis computation
SAS 4201Most algorithms to compute a Gröbner basis are “static”, inasmuch as they require as input both a set of polynomials and a term ordering, and preserve the term ordering throughout the computation. This talk presents ongoing work on “dynamic” Buchberger algorithms. First described by Sturmfels and Caboara, dynamic algorithms require only a set of polynomials…