Ranks of matrices with few distinct entries

Thursday, October 19, 2017 -
3:00pm to 4:30pm
Many applications of linear algebra method to combinatorics rely on the bounds on ranks of matrices with few distinct entries and constant diagonal. In this talk, I will explain some of these application. I will also present a classification of sets L for which no low-rank matrix with entries in L exists.
Speaker: 
Boris Bukh
Carnegie Mellon University
Event Location: 
Fine Hall 224