Symbolic Computation Group

We will disucss a number of topics relevant to a high performance implementation of the F4 algorithm for computing Groebner bases, and introduce a technique to handle rational function coefficients. Topics include (sparse) multivariate polynomial division, Faugere's F4 construction, and elimination techniques for solving large sparse linear systems. A version of this talk was given at the RICAM special semester on Groebner bases during the workshop on efficient computation.