Theory Seminar - On Linear Data Structures and Matrix Rigidity, Sivaramakrishnan Ramamoorthy
Offered By: Paul G. Allen School via YouTube
Course Description
Overview
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.
Syllabus
Introduction
Linear data structures
Upper bounds
Algorithmic questions
Redundancy
rigidity
theorem
query sets
proof
open problem
Taught by
Paul G. Allen School
Related Courses
Spectral Graph Theory - Lecture 1International Centre for Theoretical Sciences via YouTube Divergence in Coxeter Groups
IMSA via YouTube Growth in Linear Algebraic Groups and Permutation Groups
Hausdorff Center for Mathematics via YouTube Structures in Random Graphs - New Connections
Simons Institute via YouTube Introduction to Random Walks on Groups - Lecture 8
Fields Institute via YouTube