Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, May 24, 2011, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Arnau Padrol (UPC Barcelona)
A d-polytope P is neighborly if every subset of at most d/2 vertices is a face of P. In 1982, Shemer introduced a "sewing" construction that allows to add a vertex to a neighborly poltytope obtaining a new neighborly polytope.
Gale duals of neighborly polytopes have a nice geometric characterization: balanced point configurations. A configuration of n points in R^d is balanced if every hyperplane through the origin contains at least floor((n-d+1)/2) points at each of its sides.
We present a construction that allows to add points to a balanced point configuration obtaining a new balanced point configuration. In the dual setting, it constructs a neighborly polytope whose vertex figure at a particular vertex is another prescribed neighborly polytope.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 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