Shaun Fallat
Professor
Office: CW 307.2
E-mail: shaun.fallat@uregina.ca
Phone: 306-585-4107
Website: https://uregina.ca/~sfallat/
Current classes
MATH 327 Introductory Combinatorics, MATH 427/827 Graph Theory, MATH 890AQ Matrix Analysis and Entrywise Positivity Preservers
Research interests
Matrix theory, discrete mathematics, graph theory, combinatorial matrix analysis
Recent Publications
1) Fallat, Shaun M.; Hall, H. Tracy; Lin, Jephian C.-H.; Shader, Bryan L. The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph. Linear Algebra Appl. 648 (2022), 70–87.
2) Fallat, Shaun; Mojallal, Seyed Ahmad On the minimum number of distinct eigenvalues of a threshold graph. Linear Algebra Appl. 642 (2022), 1–29.
3) Fallat, Shaun; Meagher, Karen; Shirazi, Mahsa N. The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings. Algebr. Comb. 4 (2021), no. 4, 575–598.
4) Fallat, Shaun M.; Tifenbach, Ryan M. Sums of rank-one matrices and ranks of principal submatrices. Linear Multilinear Algebra 69 (2021), no. 1, 9–18.
5) Fallat, Shaun; Johnson, Charles R.; Sokal, Alan D. Corrigendum to "Total positivity of sums, Hadamard products and Hadamard powers: Results and counterexamples" [Linear Algebra Appl. 520 (2017) 242–259]. Linear Algebra Appl. 613 (2021), 393–396.
6) Adm, Mohammad; Fallat, Shaun; Meagher, Karen; Nasserasr, Shahla; Shirazi, Mahsa N.; Razafimahatratra, A. S. Weakly Hadamard diagonalizable graphs. Linear Algebra Appl. 610 (2021), 86–119.
Books
1) S.M. Fallat, C.R. Johnson, Totally nonnegative matrices. Princeton University Press, Princeton. 2011.