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: Thursday, May 23, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Yufei Zhao (MIT)

Packing superballs

It is a classic and difficult problem to determine the optimal packing of identical spheres in a given dimension. There is still a huge gap in our knowledge in nearly all dimensions, with an exponential gap in the best known bounds in high dimensions.

We study a variant of the sphere packing problem in high dimensions, namely the optimal translative packings of superballs, i.e., unit ℓp-balls for fixed p > 2. We give the first exponential improvement in high dimensions since van der Corput and Schaake (1936).

(joint work with Ashwin Sah, Mehtaab Sawhney, and David Stoner)

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