Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Friday, June 30, 2006, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Carsten Lange (University of Washington, Seattle)
J.-L. Loday presented in 2002 an algorithm that yields integer coordinates for the asociahedron (or Stasheff polytope) from planar binary trees. He asked for a similar procedure to realise the cyclohedron (or Bott-Taubes-polytope or generalised associahedron of type B). A generalised version of his algorithm will be presented: For every orientation of a Coxeter graph of type A or B we obtain a realisation of the associahedron or cyclohedron with integer coordinates.
Joint work with Christophe Hohlweg.
Automatic MiSe System Software Version 1.4803M | admin login