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

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Thursday, May 22, 2008, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Eran Nevo (Cornell Univ., Ithaca)

Let $v$ and $e$ be the numbers of vertices and edges, respectively, of a simplicial polytope $P$. Define $g_2(P)=e-dv+\binom{d+1}{2}$. Barnette proved that $g_2(P)$ is nonnegative. Kalai proved that the simplicial polytopes with $\g_2=0$ are the stacked polytopes ($d\geq 4$). We characterize the $\g_2=1$ case. It turns out they are the polytopes obtained by stacking over either a join of two simplices, each of dimension at least two, whose dimensions add up to $d$, or a join of a polygon with a $(d-2)$-simplex ($d\geq 4$). The proof uses rigidity theory of graphs and Alexander duality, and works in the generality of homology spheres. Related problems will be mentioned. All the needed notions will be explained in the talk.

Joint work with Eyal Novinsky.

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

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