Some algorithmic aspects of local cohomology

Wednesday, December 13, 2006 - 11:15am - 12:15pm
Lind 409
Gennady Lyubeznik (University of Minnesota, Twin Cities)
One application of local cohomology is that it provides a lower bound on the number of defining equations of algebraic varieties. To be useful for this application, local cohomology must be efficiently computable. We will discuss some computability issues and resulting lower bounds for the number of defining equations of some interesting varieties.