### Matrix completion and tensor codes

- Series
- Algebra Seminar
- Time
- Monday, September 23, 2024 - 11:30 for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Matt Larson – Princeton University and the Institute for Advanced Study

There will be a pre-seminar at 10:55 am in Skiles 005.

The rank r matrix completion problem studies whether a matrix where some of the entries have been filled in with generic complex numbers can be completed to a matrix of rank at most r. This problem is governed by the bipartite rigidity matroid, which is a matroid studied in combinatorial rigidity theory. We show that the study of the bipartite rigidity matroid is related to the study of tensor codes, a topic in information theory, and use this relation to understand new cases of both problems. Joint work with Joshua Brakensiek, Manik Dhar, Jiyang Gao, and Sivakanth Gopi.