Event Series
Event Type
Wednesday, November 29, 2023 12:00 PM
Matt Larson (Stanford)

Suppose that some subset of the entries of an m x n matrix are filled in with generic complex numbers. If we are allowed to fill in the remaining entries in any way that we want, what is the smallest rank that we can make it? I will explain some techniques to address this problem and what little is known.