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, May 20, 2016, 12:15 pm
Duration: 30 minutes
Location: CAB G11
Speaker: Carsten Lange (TU München)
In 2001, Lovasz explicitly described how Colin de Verdiere matrices of a 3-connected planar graph G correspond to representations of G as 1-skeleton of a convex 3-polytope. The proof extends an earlier result of Lovasz and Schrijver and exploits spectral properties of these matrices associated to G. We now consider the following open problem for d>3. Suppose we are given a Colin de Verdiere matrix M for a graph G that is known to be the 1-skeleton of some convex d-polytope although the polytope is not known. Is it then possible to recover from M a convex d-polytope with 1-skeleton G? In my talk, I wil explain the notion of a Colin de Verdiere matrix, outline the approach of Lovasz in dimension 3 and indicate a positive answer of the problem for the Cayley graph of any finite Coxeter group.
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