Event Detail

Event Type: 
Geometry-Topology Seminar
Monday, February 17, 2020 - 12:00 to 12:50
Kidd 236

Speaker Info

CS - Oregon State University

Discrete Laplace de Rham operators are a sequence of matrices defined on simplicial complexes. The first matrix in this sequence, the graph Laplacian, has been extensively studied in the last couple of decades. These studies resulted in a series of simple and elegant algorithms that helped important applications in computer science. From these results, natural open questions arises about the higher dimensional matrices in the sequence, which are largely under-explored in contrast to graph Laplacians.

In this talk, I give a quick overview of graph Laplacians and their significance in theoretical computer science. Also, I will discuss natural followup open questions for simplicial complexes and their Laplacians.