Ranks of matrices with few distinct entriesAlgebra & Discrete Mathematics
|Start time:||Wed, Jan 11 2017, 3:10PM|
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.