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, December 06, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Andreas S. Schulz (MIT and ETH Zürich)

How many diamonds can be packed in a Chinese checkerboard?

This question was published in the 1976 issue of American Mathematical Monthly. While an answer has been known since 1978, we will revisit this question to study the usefulness of linear programming relaxations. This study will lead to the definition of the rank of a polytope, which in turn gives rise to another question: what is the maximum rank of a 0/1-polytope? The ultimate answer is not known, and good upper bounds are relatively recent. If time permits, we shall sketch the proof for one of them.

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