DisCoMath Seminar: Orthogonal matrices with a given pattern of zero entries

Event Image
discomath seminar shahla nasserasr

Discrete & Computational Math Seminar (DisCoMath)
Orthogonal matrices with a given pattern of zero entries

Dr. Shahla Nasserasr
Assistant Professor
School of Mathematical Sciences, RIT

Register Here for Zoom Link

Abstract:
For a given graph G, let S(G) be the set of all symmetric matrices such that the (i,j) entry with I ≠ j is zero exactly when ij is not an edge of G. The case when S(G) contains an orthogonal matrix is especially interesting because that means G has two distinct eigenvalues (q(G) = 2). It is known that for any two connected graphs with the same number of vertices there is a symmetric orthogonal matrix compatible with their join. This statement is generalized by Levene et al. to graphs that are not necessarily connected. In this talk, we will focus on this generalization in the paper: https://arxiv.org/abs/2012.12694

Speaker Bio:
Dr. Nasserasr is an Assistant Professor in the School of Mathematical Sciences at RIT.  She received her Ph.D. in matrix analysis from the College of William and Mary in 2010. Prior to joining RIT in 2020, she was an Associate Professor of Mathematics at Brandon University, Canada. Dr. Nasserasr’s research interests include combinatorial matrix theory, inverse eigenvalue problem, totally positive matrices, and graph theory.​

Intended Audience:
Undergraduates, graduates, and experts. Those with interest in the topic.

Keep up with DisCoMath Seminars on the DisCoMathS webpage.
To request an interpreter, please visit myaccess.rit.edu


Contact
Brendan Rooney
Event Snapshot
When and Where
March 08, 2021
2:00 pm - 3:00 pm
Room/Location: See Zoom Registration Link
Who

Open to the Public

Interpreter Requested?

No

Topics
research