Foundations of Computational Mathematics
IMA, Minneapolis, August 5-14, 2002

Workshop on Computational Algebraic Geometry
August 8-10, 2002









This is one of the 19 workshops at FoCM Third International Meeting.

The workshop will focus on Effective and Algorithmic Methods in  Algebraic Geometry, Commutative Algebra, Computational Algebra and related fields.  It includes, but is not restricted to,  Symbolic, Numeric and Symbolic-Numeric techniques, and Theoretical and Practical Complexity Issues.

The aim is to encourage the interaction between the different approaches, and the emphasis will be on communicating ideas to a broadly based audience.
 

Schedule of the talks:
(Please take into account that as we have 45 and 30' talks, the timetable changes from day to day. The slots are of 50 and 35' since after each talk  there are 5' for questions and comments .)
 
 

August 8

1:50 - 2:40
Mike Shub
(Semi-plenary)
 A Mathematical Problem arising 
in Printing Technology
2:40 - 3:30
Chris Peterson
 Resultants, Uniform Position 
and Decomposition of Modules
3:30 - 4:00
TEA TIME
 
4:00 - 4:50
Andrew Sommese
Symmetric Functions applied to decomposing 
Solution Sets of Polynomial Systems
4:50 - 5:25
Laura Matusevich
Comprehensive Gröbner Bases 
and A-Hypergeometric Systems
5:25 - 6:00
Martin Sombra
An Arithmetic Bernstein-Kushnirenko Inequality
6:00 - 6:35
Thierry Zell
On the Number of Connected Components 
of the Relative Closure of a Semi-Pfaffian family

 

August 9

1:50 - 2:40
Franz Winkler
 Quadratic Forms and the Parametrization Problem
2:40 - 3:30
Dale Brownawell
(Semi-plenary)
 Aspects of the Nullstellensatz
3:30 - 4:00
TEA TIME
 
4:00 - 4:50
Luis Miguel Pardo
From Continuous to Discrete Estimates in Numerical Analysis:
An Application of the Geometry of Numbers
4:50 - 5:40
Yosef Yomdin
Complexity of Functions via their Approximation 
by Semialgebraic ones
5:40 - 6:30
Jan Verschelde
Software for Numerical Irreducible Decomposition

August 10

1:50 - 2:25
Agnes Szanto
 Solving over-determined Systems by Subresultant Methods
2:25 - 3:00
Dmitry Novikov
 Effective Nonoscillation of Solutions of ODE's 
and Infinitesimal Hilbert 16 Problem
3:00 - 3:35
Ilias Kotsireas
Efficient Implicitization of Hypersurfaces
3:35 - 4:00
TEA TIME
 
4:00 - 4:50
Andrei Gabrielov
(Semi-plenary)
Betti Numbers of Semialgebraic and Sub-Pfaffian Sets
4:50 - 5:40
Carlos Berenstein
The Role of Residues in Computational Algebra
5:40 - 6:15
Mohammad  Hailat
Computational Aspects of Root Systems

 

Askold Khovanskii,  Teresa Krick

Last Update: July 27th, 2002