Mon, 26 May 2008
10:00 -
11:00
L3
Computation in quotients of polynomial rings and enumerative geometry
Daniel Grayson
(UIUC)
Abstract
Abstract: I will describe how computations are done using "Groebner bases" in quotient
rings of polynomial rings, and I will describe explicitly the form of a
particular Groebner basis for the ideal defining the ring parametrizing all
factorizations of a monic polynomial of degree a+b+...+e into monic factors of
degree a,b,...,e. That can be and is used in practice to compute intersection
numbers involving of algebraic cycles arising as Chern classes on flag bundles
of vector bundles. Simplest example: how many lines in 3-space meet four fixed
lines?