New Results on Sign Patterns that Allow Diagonalizability  

作　　者：Xinlei FENG Zhongshan LI 

机构地区：[1]College of Mathematics and Physics,Leshan Normal University,Sichuan 614000,P.R.China [2]Department of Mathematics and Statistics,Georgia State University,Atlanta,GA 30302,USA

出　　处：《Journal of Mathematical Research with Applications》2022年第2期111-120,共10页数学研究及应用（英文版）

基　　金：Supported by Research Project of Leshan Normal University(Grant No.LZD016)。

摘　　要：Characterization of sign patterns that allow diagonalizability has been a long-standing open problem.In this paper,we obtain some sufficient and/or necessary conditions for a sign pattern to allow diagonalizability.Moreover,we determine how many entries need to be changed to obtain a matrix B′∈Q(A)with rank MR(A)from a matrix B∈Q(A)with rank mr(A).Finally,we also obtain some results on a sign pattern matrix in Frobenius normal form that allows diagonalizability.

关 键 词：sign pattern allowing diagonalizability maximum cycle length minimum rank maximum rank Frobenius normal form 

分 类 号：O151.21[理学—数学]