Prof. Emo Welzl and Prof. Bernd Gärtner
|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)
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.
Automatic MiSe System Software Version 1.4803M | admin login