BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Events//NONSGML v1.0//EN
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART;TZID="Pacific Time (US & Canada)":20241014T161000
DTEND;TZID="Pacific Time (US & Canada)":20241014T170000
SUMMARY:Mathematics and Statistics Seminar – Hermie Monterde
LOCATION:
DESCRIPTION:Seminar in Theory and Applications\n\nof\n\nDiscrete Math, Linear Algebra and Number Theory\n\nDepartment of Mathematics and Statistics\n\nZoom\n\nOctober 14, Monday, 4:10 - 5:00 PM\n\n \n\nTitle: Weakly Hadamard diagonalizable graphs\n\nSpeaker: Hermie Monterde\n\nAbstract: A matrix ? is said to be ?-diagonalizable if there exists a matrix ? having entries from ? such that ?=?Δ?^−1 for some diagonal matrix Δ. A graph ? is said to be ?-diagonalizable if its Laplacian matrix ?:=?−? is ?-diagonalizable (Johnston and Plosker, 2023). Here, ? is the diagonal matrix of vertex degrees of ? and ? is the adjacency matrix of ?. In this talk, we survey results on ?-diagonalizable graphs, where ?={−1,0,1} or ?={−1,1}. In particular, we will focus on the case where ? is a Hadamard (that is, ? has entries from {−1,1} and the columns of ? are pairwise orthogonal) or a weak Hadamard matrix (that is, ? has entries from {−1,0,1} and the nonconsecutive columns of ? are pairwise orthogonal). Our main motivation for considering these graphs is its potential application to theory of continuous-time quantum walks, where knowledge about eigenvectors of certain matrices associated to graphs (more specifically, their orthogonal projection matrices) is important in determining which types of quantum state transfer occur in a graph. Some of the material presented in this talk is joint work with Darian McLaren and Sarah Plosker.
BEGIN:VALARM
ACTION:DISPLAY
DESCRIPTION:REMINDER
TRIGGER;RELATED=START:-PT00H15M00S
END:VALARM
END:VEVENT
END:VCALENDAR