Explore a theory seminar on linear data structures and matrix rigidity presented by Sivaramakrishnan Ramamoorthy from the University of Washington. Delve into the equivalence between systematic linear data structures and rectangular rigidity, examine rigidity lower bounds for rank one matrix vectors, and investigate a Cayley graph question related to linear data structures. Learn about upper bounds, algorithmic questions, redundancy, rigidity theorems, query sets, proofs, and open problems in this 55-minute lecture from the Paul G. Allen School, recorded on February 11, 2020 with closed captions available.