Improvements in Maple 11's Groebner Package

Roman Pearce, CECM.

Friday September 22nd at 10:30am in K9509.


In this talk we will present some non-trivial improvements in Maple 11's
Groebner package, with an emphasis on algorithms and their implementation.
The point of these algorithms is to solve or compute with multivariate
polynomial systems.  Topics include Groebner bases and the F4 algorithm
for computing them (now used by default in Maple), improved Groebner basis
conversion algorithms (FGLM & Groebner Walk), a sparse division algorithm
(normal form) based on F4, improvements to Stephen Czapor's factoring
Buchberger (gsolve) command, and rational univariate representations.
I will limit the talk to half an hour.