Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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: CAB G51
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login