Foundations of Computational Mathematics

Santander, June 30 - July 9, 2005

Workshop on Computational Algebraic Geometry
June 30 - July 2, 2005

The workshop will focus on Effective and Algorithmic Methods in Algebraic Geometry, Commutative Algebra, Computational Algebra, and related fields. The topics include, but are not restricted to, Symbolic, Numerical and Symbolic-Numerical techniques, and Theoretical and Practical Complexity Issues.

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

The FoCM plenary speakers associated to this workshop are

Luis Miguel Pardo: How Upper and Lower Complexity Bounds meet in Elimination Theory

(Ten years later)

Bernd Sturmfels: Algebraic Statistics for Computational Biology

Schedule of the talks:

The talks are of 40', 30' or 20', plus after each talk 5' for questions and comments (that's why the slots are 5' longer), and 5' for stretching legs between talks.

June 30

1:50 - 2:35	Wolfram Decker	Some examples in computational algebraic geometry
2:40 - 3:25	Askhold Khovanskii (Semi-plenary)	Insolvability of equations in finite terms
3:30 - 4:00	TEA TIME
4:00 - 4:45	Alicia Dickenstein	Binomial complete intersections
4:50 - 5:35	Bernard Mourrain	Subdivision methods for solving polynomial equations
5:40 - 6:25	Martín Sombra	On the size of the solutions of sparse polynomial systems

July 1st

1:50 - 2:35	Orlando Villamayor	Flattening of morphisms and applications to singularities over perfect fields
2:40 - 3:25	Andrei Gabrielov	Lower bounds in some problems of real Schubert calculus
3:30 - 4:00	TEA TIME
4:00 - 4:45	Marc Giusti (Semi-plenary)	Singularities may reduce complexities... unfortunately not always!
4:50 - 5:15	Gabriela Jeronimo	On the computation of resolvent representations
5:20 - 5:45	Martin Lotz	On the computational complexity of the Hilbert polynomial
5:50 - 6:25	Carlos D'Andrea	On arithmetic aspects of sparse resultants

July 2nd

1:50 - 2:35	Nikolai Vorobjov	Topological complexity of definable sets
2:40 - 3:25	Grégoire Lecerf	Quadratic Newton iteration for systems with multiple zeroes and clusters of zeroes
3:30 - 4:00	TEA TIME
4:00 - 4:45	Agnes Szanto	The nearest multivariate system with given root structure
4:50 - 5:35	Ilya Itenberg (Semi-plenary)	Tropical geometry and asymptotic enumeration of real rational curves
5:40 - 6:25	Tomás Recio	Computing the parametrization of algebraic varieties over the field of definition

Andrei Gabrielov, Teresa Krick

Last Update: June 2nd, 2005