|From Polynomial Interpolation to the Complexity of Ideals|
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.
|Web page: Alexandru I. Suciu||Comments to: firstname.lastname@example.org|
|Posted: June 8, 2006||URL: http://www.math.neu.edu/bhmn/eisenbud06.html|