Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, July 27, 2004, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Volker Kaibel (TU Berlin)

Low-dimensional faces of random 0/1-polytopes

Let P be a random 0/1-polytope in Rd with n(d) vertices, and denote by φk(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and \binom{n(d)}{k+1}. For each k >= 2, we establish the existence of a sharp threshold for the k-face density and determine the values of the threshold numbers τk such that, for all ε > 0,
E(φk(P)) =

holds for the expected value of φk(P). The threshold for k=1 has recently been determined by K. and Remshagen (2003).

In particular, these results indicate that the high face densities often encountered in polyhedral combinatorics (e.g., for the cut-polytopes of complete graphs) should be considered more as a phenomenon of the general geometry of 0/1-polytopes than as a feature of the special combinatorics of the underlying problems.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  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