Parameters related to the minimum rank problem
林晉宏先生Department of Mathematics, Iowa State University 上午 11:00–12:30 鴻經館 107 室Abstract:
For a given graph G, the minimum rank problem is to find the smallest possible rank among the real symmetric matrices whose off-diagonal i,j-entry is nonzero if ij is an edge and zero otherwise. The diagonal entries can be any real number. In this talk we will discuss some parameters related to the minimum rank problem and their relations. Also, a new parameter will be introduced as an lower bound for the minimum rank.