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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 04, 2008, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Yves Brise

Covering Spheres with Spheres

We consider $\vartheta$, the minimum density of a covering of some $d$-sphere by unit balls in $\mathbb{R}^{d+1}$. Intuitively speaking the covering density is the average number of balls containing any given point on the sphere. In an older result, around 1960, Rogers has shown that $\vartheta$ is at most $d \ln d$ plus some lower order terms. This upper bound has just recently been improved, by Dumer in 2007, to $1/2 d \ln d$ plus lower order terms. This is only an improvement in the constant of the leading term, but still remarkable for such a long standing upper bound as the Rogers bound. The lower bound $\vartheta \in \Omega(d)$ is from 1959 by Coxeter, Few, and Rogers. If time permits, we will also speak about this.

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

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