About Keivan (more)
I am a PIMS postdoctoral fellow in the mathematics and statistics department at University of Calgary, working under supervision of Kris Vasudevan and Mike Cavers and in collaboration with Cam Teskey's lab at Hotchkiss Brain Institute. Prior to this, I was a postdoctoral fellow here under supervision of Peter Lancaster and Alex Brudnyi. I received my PhD (2014) and MSc (2011) from University of Wyoming under supervision of Bryan Shader, and BSc (2009) from Amirkabir University of Technology (Tehran Polytechnic).
My CV: PDF
Publications Summary: PDF
My CV: PDF
Publications Summary: PDF
Research Interests (more)
 Linear Algebra and Matrix Analysis
 Combinatorics and Graph Theory
 Applications in Neuroscience and Economics
Current Teaching (more)
Recently Published or Submitted Papers (more)
 Inverse spectral problems for linked vibrating systems and structured matrix polynomials Keivan Hassani Monfared and Peter Lancaster: PDF
 We show that for a given set of $nk$ distinct real numbers \( \Lambda \), and \(k\) graphs on \(n\) nodes, \(G_0, G_1,\cdots,G_{k1}\), there are real symmetric \(n\times n\) matrices \(A_s\), \(s=0,1,\ldots, k\) such that the matrix polynomial \(A(z) := A_k z^k + \cdots + A_1 z + A_0\) has proper values \(\Lambda\), the graph of \(A_s\) is \(G_s\) for \(s=0,1,\ldots,k1\), and \(A_k\) is an arbitrary nonsingular (positive definite) diagonal matrix. When \(k=2\), this solves a physically significant inverse eigenvalue problem for linked vibrating systems.
 A Structured Inverse Spectrum Problem For Infinite Graphs
Keivan Hassani Monfared and Ehssan Khanmohammadi: PDF It is shown that for a given infinite graph \(G\) on countably many vertices, and a bounded, countably infinite set of real numbers \(\Lambda\) there is a symmetric matrix whose graph is \(G\) and its spectrum is the closure of \(\Lambda\).
 Existence of a Not Necessarily Symmetric Matrix with Given Distinct Eigenvalues and Graph Keivan Hassani Monfared, Linear Algebra and its Applications: PDF
 For given distinct numbers \(\lambda_1 \pm \mu_1 \rm{i}, \lambda_2 \pm \mu_2 \rm{i}, \ldots, \lambda_k \pm \mu_k \rm{i} \in \mathbb{C} \setminus \mathbb{R}\) and \(\gamma_1, \gamma_2, \ldots, \gamma_l \in \mathbb{R}\), and a given graph \(G\) with a matching of size at least \(k\), we will show that there is a real matrix whose eigenvalues are the given numbers and its graph is \(G\). In particular, this implies that any real matrix with distinct eigenvalues is similar to a real, irreducible, tridiagonal matrix.
 The nowherezero eigenbasis problem for a graph
Keivan Hassani Monfared and Bryan L. Shader, Linear Algebra and its Applications: PDF. Using previous results and methods, it is shown that for any connected graph \(G\) on \(n\) vertices and a set of \(n\) distinct real numbers \(\Lambda\), there is an \(n\times n\) real symmetric matrix \(A\) whose graph is \(G\), its spectrum is \(\Lambda\), and none of the eigenvectors of \(A\) have a zero entry.
Recent or Upcoming Talks (more)
 Counting to infinity  July 2017
High School Math Camp at University of Calgary, Calgary, AB, Canada  Using the Jacobian method to solve several inverse eigenvalue problems for graphs  July 2016
20th Conference of the International Linear Algebra Society (ILAS), Leuven, Belgium  Some Inverse Eigenvalue Problems for Graphs  May 2016
Western Canada Linear Algebra Meeting (WCLAM),The University of Manitoba, Winnipeg, MB, Canada
News
We are organizing an AMS special session on Emerging Topics in Graphs and matrices at the Joint Mathematics Meeting 2018, in San Diego, CA. Check out the schedule and plan to attend some of the great talks. It is going to be a great session.

Saturday January 13, 2018, 8:00 a.m.11:50 a.m.

8:00 a.m.
Nonsparse companion matrix constructions.
Louis Deaett, Quinnipiac University
Jonathan Fischer, Redeemer University College
Colin Garnett, Black Hills State University
Kevin Vander Meulen*, Redeemer University College
(1135152318) 
8:30 a.m.
Matroids and the minimum rank of matrix patterns.
Louis Deaett*, Quinnipiac University
(1135053052) 
9:00 a.m.
Tree Sign Patterns that Require $\mathbb{H}_n$.
Wei Gao*, Auburn University
Zhongshan Li, Georgia State University
Lihua Zhang, Georgia State University
(113515200) 
9:30 a.m.
Compressed Cliques Graphs and Positive Zero Forcing.
Shaun Fallat*, University of Regina
Karen Meagher, University of Regina
Abolghasem Soltani, University of Regina
Boting Yang, University of Regina
(1135152482) 
10:00 a.m.
On the error of a priori sampling: zero forcing sets and propagation time.
Franklin H. J. Kenter*, United States Naval Academy
Jephian C.H. Lin, University of Victoria
(1135051082) 
10:30 a.m.
The inverse eigenvalue problem of a graph: Multiplicities and minors.
Wayne Barrett, Brigham Young University
Steve Butler, Iowa State University
Shaun M. Fallat, University of Regina
H. Tracy Hall, Brigham Young University
Leslie Hogben, Iowa State University
Jephian C.H. Lin*, University of Victoria
Bryan L. Shader, University of Wyoming
Michael Young, Iowa State University
(1135151215) 
11:00 a.m.
7 theorems in spectral extremal graph theory.
Michael Tait*, Carnegie Mellon University
(1135051178) 
11:30 a.m.
Switched symplectic graphs and their 2ranks.
Aida Abiad*, Maastricht University
Willem Haemers, Tilburg University
(1135051840) 
Saturday January 13, 2018, 1:00 p.m.5:50 p.m.
AMS Special Session on Emerging Topics in Graphs and Matrices, II
Room 33B, Upper Level, San Diego Convention Center
Organizers:
Sudipta Mallik, Northern Arizona University sudipta.mallik@nau.edu
Keivan Hassani Monfared, University of Calgary
Bryan Shader, University of Wyoming

1:00 p.m.
A generalized AlonBoppana bound and weak Ramanujan graphs.
Fan Chung*, University of California, San Diego
(1135151687) 
2:00 p.m.
Perfect state transfer in perturbations of strongly regular graphs.
Chris Godsil, University of Waterloo
Krystal Guo, Universite Libre de Bruxelles
Mark Kempton*, Harvard University, Center of Mathematical Sciences and Applications
Gabor Lippner, Northeastern University
(113505665) 
2:30 p.m.
On the Wiener index, distance cospectrality and transmissionregular graphs.
Aida Abiad, Maastricht University
Boris Brimkov, Rice University
Aysel Erey, University of Denver
Lorinda Leshock, University of Delaware
Xavier MartinezRivera*, Auburn University
Suil O, The State University of New York, Korea
SungYell Song, Iowa State University
Jason Williford, University of Wyoming
(113505942) 
3:00 p.m.
On the eigenvalues of acyclic matrices.
Mohammad Adm*, University of Konstanz, Konstanz, Germany and University of Regina, Regina, Canada
Shaun Fallat, University of Regina, Regina, Canada
(1135152068) 
3:30 p.m.
Break 
4:00 p.m.
Graph curvature and the geometry and eigenvalues of graphs.
Paul K Horn*, University of Denver
(1135053050) 
4:30 p.m.
The inertia bound for a graph.
John Sinkovic*, University of Waterloo
Zachary Dockstader, University of Waterloo
(1135051811) 
5:00 p.m.
The smallest eigenvalues of Hamming and Johnson graphs.
Andries E. Brouwer, Eindhoven University of Technology
Sebastian M. Cioabă, University of Delaware
Ferdinand Ihringer, Einstein Institute of Mathematics, Hebrew University of Jerusalem
Matt McGinnis*, University of Delaware
(1135051373) 
5:30 p.m.
Equitable Decompositions of Graphs: Using any symmetry of a graph (or matrix) to simplify eigenvalue and eigenvector computations.
Amanda E Francis*, Carroll College
Ben Webb, Brigham Young University
Dallas Smith, Brigham Young University
(1135151258)

1:00 p.m.
AMS Special Session on Emerging Topics in Graphs and Matrices, I
Room 33B, Upper Level, San Diego Convention Center
Organizers:
Sudipta Mallik, Northern Arizona University sudipta.mallik@nau.edu
Keivan Hassani Monfared, University of Calgary
Bryan Shader, University of Wyoming