Combinatorics Seminar
Boris Bukh
Carnegie Mellon University
Ranks of matrices with few distinct entries
Abstract: Many applications of the 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.
Monday April 17, 2017 at 2:00 PM in SEO 612