Seminar No.1551 Essential sign change numbers and minimum ranks of sign patterns Created Date 12/4/2017 谭福平   View Numbers  500 Return
 Title:  Essential sign change numbers and minimum ranks of sign patterns Reporter:  Prof. Zhongshan Li (Georgia State University)Time: 2017-12-12 ( Tuesday) 14:00Place: G507Abstract: A sign pattern (matrix) is a matrix whose entries are from the set $\{+, -, 0\}$ and a sign vector is a vector whose entries are from the set $\{+, -, 0\}$. A sign pattern or sign vector is full if it does not contain any zero entries. The minimum rank of a sign pattern matrix $\cal A$ is the minimum of the ranks of the real matrices whose entries have signs equal to the corresponding entries of $\cal A$. The notions of essential row sign change number and essential column sign change number are introduced for full sign patterns and condensed sign patterns. By inspecting the sign vectors realized by a list of real polynomials in one variable, a lower bound on the essential row and column sign change numbers is obtained. Using point-line configurations on the plane, it is shown that even for full sign patterns with minimum rank 3, the essential row and column sign change numbers can differ greatly and can be much bigger than the minimum rank. Some open problems concerning square full sign patterns with large minimum ranks are discussed.
 CopyRight © Shanghai University    沪ICP备09014157   Address : 99 Shangda Road, BaoShan District, Shanghai.（traffic）   Zip Code : 200444   Tel. Technical Support : Information Technology Office of Shanghai University   Contact Us