August 2001

BACK

We will discuss Groebner bases from a computational point of view. We will see Buchberger's algorithm, the elimination theorem and its pitfalls, and relations to integer programming. This is an informal talk and questions are encouraged.

Short Bio:

• Uli Walther: born + raised in Soviet colony "DDR"
• MSc Pure Mathematics Sheffield University
• Diplom Mathematik Martin-Luther Universitaet
• Halle-Wittenberg PhD University of Minnesota
• Postdoc MSRI Berkeley now
• Assistant Professor Purdue University
• Hobbies: football (aka soccer), reading, cooking, being married (ndlr: to mimi ;)

More details under : http://www.math.umn.edu/~walther/research/

Some links related to Groebner bases :

• Maths/Intro:
  • http://www.riaca.win.tue.nl/CAN/CA_Library/Groebner/
  • http://www.geocities.com/CapeCanaveral/Hall/3131/g_bases.html
  • http://www.math.uiuc.edu/Macaulay2/Manual/0392.html
• Research :
  • Uli's research : http://www.math.umn.edu/~walther/research/
  • T.G. Berry's research : http://www.ldc.usb.ve/~berry/preprints.html
    • "Groebner bases of the ideals of space curves",
      Jour. Pure Appl. Alg. 148 (2000), pp17-47.
      PDF version : , PS version (compressed with gzip).
  • http://naomi.is.s.u-tokyo.ac.jp/INTRO/grobner/grobner.html
• Applications:
  • Wavelets: http://www.ece.cmu.edu/~spiral/presentations/aca99/selesnik/abstract.html

BACK

Last Updated: August 23, 2001