Talks
Spring 2019

Problems and Progress in Algorithmic Discrepancy
Tuesday, February 12th, 2019, 2:30 pm–3:30 pm
Speaker:
Nikhil Bansal (Eindhoven University of Technology)
Combinatorial discrepancy deals with the following question. Given a collection of vectors or matrices A_i, determine -1 or +1 signs s_i such that some suitable norm of the signed sum \sum_i s_i A_i is as small as possible. I will briefly survey some recent techniques that have been developed to address such problems and describe some open problems in the area.
Attachment | Size |
---|---|
![]() | 443.29 KB |