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: Tuesday, June 07, 2011, 12:15 pm

Duration: This information is not available in the database

Location: CAB G51

Speaker: Jiří Matoušek (Charles Univ.)

Discrepancy, Bansal's algorithm and the determinant bound

Last year Nikhil Bansal found a polynomial-time algorithm for computing low-discrepancy colorings, based on semidefinite programming. It makes several existential bounds for the discrepancy of certain set systems, such as all arithmetic progressions on {1,2,...,n}, constructive, which has been a major open problem in discrepancy theory. We use Bansal's result, together with the duality of semidefinite programming and a linear-algebraic lower bound for discrepancy due to Lovasz, Spencer, and Vesztergombi, to answer an old question of Sos, concerning the maximum possible discrepancy of the union of two set systems.

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