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 14, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Eran Nevo (Cornell Univ., Ithaca)

Missing faces and generalized lower bounds on face numbers

We consider simplicial polytopes, and more general simplicial complexes, without missing faces above a fixed dimension. (F is a missing face of a complex K if the boundary of F is contained in K and F is not in K.) We conjecture sharp analogues of McMullen's generalized lower bounds, and of Barnette's lower bounds, for these families of complexes. This gives a hierarchy of conjectures on lower bounds on face numbers, interpolating between McMullen's generalized lower bound conjecture for simplicial spheres and Gal's conjecture for flag spheres. We provide partial results on these conjectures.

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