From graphs to matrices - there and back again!
Time and place
12:30–1:30 PM on Tuesday, June 27th, 2023; MR 4
Miodrag Iovanov (Univ. of Iowa)
Abstract
To every graph one can associate its incidence matrix which is very helpful in various questions regarding the graph. In this talk, we will explore how we can get back, and associate to every matrix a graph, which records its pattern of zeros, and which is in some sense exactly the inverse process, and in fact helps solve a concrete linear algebra problem: classify matrices up to the equivalence given by conjugation by diagonal matrices (or, in fancy terms, parametrize the orbits of the action of the torus of diagonal matrices on all matrices).
