Polyhedral Computation

October 17-20, 2006
Centre de recherches mathématiques

Organizers: David Avis (McGill), David Bremner (New Brunswick) and Antoine Deza (McMaster)

The last fifteen years have seen significant progress in the development of general purpose algorithms and software for polyhedral computation (e.g. finding lattice points, enumerating vertices, extreme rays and facets and triangulating polyhedra). Many polytopes of practical interest have enormous output complexity and are often highly degenerate, posing severe difficulties for known general purpose algorithms. They are, however, highly structured and attention has turned to exploiting this structure, particularly symmetry. Initial applications of this approach have permitted computations previously far out of reach, but much remains to be understood and validated experimentally. This workshop will bring together researchers with both theoretical and computational expertise with polyhedral computations.