From Polynomial Interpolation to the Complexity of Ideals


David Eisenbud

MSRI and UC Berkeley

Harvard University

Thursday, December 7, 2006


Talk at 4:30 p.m. in Science Center D

Tea at 4:00 p.m. in the Math Lounge


Abstract:   One natural question in interpolation theory is: given a finite set of points in R^n, what is the least degree of polynomials on R^n needed to induce every function from the points to R? It turns out that this "interpolation degree" is closely related to a fundamental measure of complexity in algebraic geometry called Castelnuovo-Mumford regularity. I'll explain these ideas and some of their current interest in algebraic geometry and commutative algebra.


Home Web page:  Alexandru I. Suciu   Comments to:  
Posted: June 8, 2006    URL: