Till innehåll på sidan

Lisa Nicklasson: Efficient computation of zero-dimensional Gröbner bases by change of ordering

Tid: On 2016-02-17 kl 15.30 - 16.30

Plats: Room 16, building 5, Kräftriket, Department of mathematics, Stockholm university

Medverkande: Lisa Nicklasson, Stockholm university

Exportera till kalender

In this talk we will review the so called FGLM-algorithm. This is an algorithm for the transformation of a Gröbner basis of a zero-dimensional ideal with respect to any given monomial ordering, into a Gröbner basis with respect to any other ordering.

This talk is part of an examination of a PhD course in Gröbner bases.

Tillhör: Stockholms Matematikcentrum
Senast ändrad: 2016-02-12