Ranks of matrices with few distinct entries

Ranks of matrices with few distinct entries

-
Boris Bukh, Carnegie Mellon University
Fine Hall 224

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.