Virtual Math Colloq. Aug. 28, 3pm
"All the Seasons of MinRank"
Dr. Daniel Smith-Tone, University of Louisville
Friday, August 28, 3pm Virtual Room (TBA)
The MinRank problem is the very natural question of determining the matrix of least rank in the span of a collection of matrices. (Of course we mean nonzero linear combinations.) The decisional version of this problem is known to be NP-complete. Nevertheless, the computational version is often tractable for practical instances. We will talk about how this problem arises and show how different types of instances admit efficient resolution with different techniques. About 80% of the talk will require nothing more than a 3rd grade understanding of linear algebra.