Discrete & Computational Math: Shahla Nasserasr
Discrete & Computational Math Seminar (DisCoMath)
On the Inverse Eigenvalue Problem and Distinctness of Eigenvalues
Shahla Nasserasr
School of Mathematical Sciences
Rochester Institute of Technology
Abstract: Consider the set all 𝑛×𝑛 real symmetric matrices where all of them follow a fixed pattern of zero-nonzero entries on their off-diagonal entries. The inverse eigenvalue problem then asks to determine all possible spectra of such matrices. The question is difficult and one way to relax it is to study the minimum number of distinct eigenvalues instead of the values of the eigenvalues. This parameter is denoted by 𝑞(𝐺) where 𝐺 is a graph that represents the pattern of the set of matrices. In this presentation, I will review some of the results and the techniques from recent developments about 𝑞(𝐺).
Intended Audience: Undergraduates
Keep up with DisCoMath Seminars on the DisCoMathS webpage.
To request an interpreter, please visit myaccess.rit.edu
Event Snapshot
When and Where
Who
Open to the Public
Interpreter Requested?
No