Applied & Computational Mathematics seminar: On Matrix Completion Problems with Structural Constraints

Speaker:  Alex Sprintson, ECE, GMU

Title:  On Matrix Completion Problems with Structural Constraints

Abstract:   Matrix completion problems naturally arise in a wide range of applications, including Index Coding, Maximally Recoverable Codes, and Maximum Distance Profile (MDP) Convolutional Codes. In a typical matrix completion problem, the goal is to construct a matrix that meets specific rank conditions on its minors while adhering to structural constraints, such as predefined row support patterns. In this talk, we will provide an overview of several related matrix completion problems, highlighting key design and proof techniques for solving them over finite fields. Additionally, we will discuss open problems in this area, offering insights into potential directions for future research.

Time:  Friday, November 21, 1:30pm – 2:30pm

Place:  Exploratory Hall, room 4106