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: Monday, November 18, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Noga Alon (Tel Aviv University and IAS, Princeton)

The geometry of majority sequences

I will consider an extremal problem in Combinatorial Geometry motivated by a question in Social Choice Theory. Its study combines geometric and combinatorial ideas with tools from linear algebra and discrepancy theory, and is related to results by Huckeman, Jurkat and Shapley on indecomposable hypergraphs, of Graham and Sloane on anti-Hadamard matrices, of Hastad on threshold gates requiring large weights and of Vu and myself on a coin weighing problem.

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