Atlas home || Conferences | Abstracts | about Atlas
Host: Texas A&M University
Homepage: http://www.math.tamu.edu/conferences/cbms/
Email: cbms@math.tamu.edu
Description:
The search for efficient algorithms for solving polynomial systems quickly leads to some of the deepest questions of modern mathematics. Polynomial systems are also ubiquitous in applied mathematics, arising in robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, and numerous other areas.
Exciting recent developments in algebraic algorithms and numerical software for geometric calculations have revolutionized the area, making many formerly inaccessable problems tractable, and providing a fertile ground for experimentation and conjecture. These lectures, by the leading world expert in combinatorial and computational algebraic geometry, present the state of the art in this branch of mathematics. The main thread will be to look at polynomial equations from a variety of different angles, some of them new and unexpected. This conference will also feature invited lectures from leading experts in the field.
Date received: April 20, 2002
© 2008 Atlas Conferences Inc.