Groebner Basis Conversion with FGLM
Roman Pearce, MITACS project
Simon Fraser University
The FGLM algorithm of Faugere, Gianni, Lazard and Mora, is a fast and effective way to construct Groebner bases for zero-dimensional ideals when at least one Groebner basis is already known. One application is solving systems of polynomial equations, where a difficult lexicographic basis can be obtained from an easier total degree basis. We will explain and demonstrate the method, and show how it can be used to compute the radical of an ideal.