Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Title: Inverse eigenvalue problem of a graph
Speaker: | Jephian C.-H. Lin |
Affiliation: | National Sun Yat-sen University |
Location: | Please contact Sabrina Lato for Zoom link |
Abstract: We often encounter matrices whose pattern (zero-nonzero, or sign) is known while the precise value of each entry is not clear. Thus, a natural question is what we can say about the spectral property of matrices of a given pattern. When the matrix is real and symmetric, one may use a simple graph to describe its off-diagonal nonzero support. For example, it is known that an irreducible tridiagonal matrix (whose pattern is described by a path) only allows eigenvalues of multiplicity one. In contrast, a periodic Jacobi matrix (whose pattern is described by a cycle) allows multiplicity two but no more. The inverse eigenvalue problem of a graph (IEPG) focuses on the matrices whose pattern is described by a given graph and studies their possible spectra. In this talk, we will go through some of the histories of the IEPG and see how combinatorial methods (zero forcing) and analytic methods (implicit function theorem) can come into play in modern-day research.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.