共 5 条
The decomposability of the matrix with two determinantal regional components
被引:4
作者:
Liu, Yue
[1
]
Shao, Jia-Yu
[1
]
Fang, Min
[1
]
机构:
[1] Tongji Univ, Dept Math, Shanghai 200092, Peoples R China
基金:
中国国家自然科学基金;
关键词:
Complex;
Matrix;
Sign;
Ray pattern;
Digraph;
Partly-decomposable;
SIGN PATTERN MATRICES;
RAY PATTERN;
D O I:
10.1016/j.laa.2009.07.013
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
The ray of a complex number a is either 0 or a/vertical bar a vertical bar depending on whether a is 0 or nonzero. The ray pattern of a complex matrix A, denoted by ray(A), is the matrix obtained by replacing each entry of A with its ray. The determinantal region of a square matrix A, denoted by R(A), is the set of the determinants of all the complex matrices with the same ray pattern as A. A connected component of the set R(A)\{O} is called a determinantal regional component of A. The number of determinantal regional components of R(A) is denoted by n(R)(A). It was proved in Shao et al. [Jia-Yu Shao, Yue Liu, Ling-Zhi Ren, The inverse problems of the determinantal regions of ray pattern and complex sign pattern matrices, Linear Algebra Appl. 416 (2006) 835-843] that n(R)(A) <= 2 for any complex square matrix A. When n(R)(A) = 2, the two determinantal regional components are either two opposite open rays or two opposite open sectors with the angle no more than pi. In this paper, we prove that any square matrix A with n(R)(A) = 2 is partly decomposable if one of its determinantal regional components is an open sector with the angle less than pi. As a main graph theoretical technique, we also discuss a property of strongly connected digraphs. (C) 2009 Elsevier Inc. All rights reserved.
引用
收藏
页码:2187 / 2194
页数:8
相关论文