图是圈的完全正矩阵

本文证明,图是围的完全正矩阵Ａ当比较矩阵Ｍ（Ａ）的行列式大于零时,恰有两个极小秩１分解,而当ｄｅｔＭ（Ａ）＝０时,恰有一个极小秩１分解．     

关于完全正矩阵的几点注记(英文)

本文给出了一个 n×n非负、对称、弱对角占优矩阵 A为完全正的一个充分条件 .我们还给出了较好的算法 ,用以获得关于矩阵 A(当 A为完全正时 )的分解指数的一个上界 .     

关于完全正矩阵的几点注记

本文给出了一个ｎ&;#215;ｎ非负、对称、弱对角占优矩阵Ａ为完全正的一个充分条件。我们还给出了较好的算法,用以获得关于矩阵Ａ（当Ａ为完全正时）的分解指数的一个上界。     

完全正矩阵的整数分解

n阶矩阵A称为完全正的,如果A有分解:A=BB^T,其中B为元素非负矩阵,B的最小可能列数称为A的分解指数.本文考察低阶双非负矩阵在整数环上的完全正分解及其分解指数.     

完全主正矩阵的行列式不等式

给出了完全主正矩阵的凸性不等式和Minkowski型不等式,并推出了M矩阵,亚正定矩阵等类型的矩阵在一定条件下的凸性不等式和Minkowski型不等式.     

完全有向图的奇长圈覆盖

设DK_v表示完全有向对称图,C（v,m）表示覆盖DK_v的m长有向圈的最小圈数（称为覆盖数）.对任意正整数m和v,当m≤v≤m+6时,覆盖数C（v,m） 被确定.     

5阶图的结构完全正

1 简 介称n阶双非负矩阵,即非负半正定矩阵A为完全正的,如果A可分解为BBt,其中B是n×m的非负矩阵.或等价地,有n维非负向量β1,β2,…,βm使得A=β1β1t+…+βmβmt,B的可能最小的列数m称为A的分解指数（或A的CP秩）,记作 ψ（A）（或CPrankA）.记DPn为所有n阶双非负矩阵构成的集合;CPn为所有n阶完全正矩阵构成的集合.判断一个双非负矩阵是否为完全正以及确定它的分解指数是完全正矩阵研究的两个基本问题.对完全正矩阵的研究始于本世纪六十年代初,它的应用非常广泛,涉及组合设计     

完全偶图的圈基内插性质

图G的一个圈基的长度是该圈基的所有圈的长度之和。设C^-、C^ 分别是G的最小、最大圈基长度,如果对任一偶数C,C^-＜C＜C^ ,都存在G的一个长为C的圈基,则称G具有偶圈基内插性质,本证明了,完全偶图Km,n具有偶圈基内插性质。     

关于主正阵和完全主正阵的两个命题

建立了主正阵和完全主正阵关于正稳定的两个结果。     

关于图与圈之并图的圈唯一性

Farrell[1]引进图 G 的圈多项式 c(G;■).文[6]猜测:轮形图 W_8是圈唯一的.本文中我们证明上述猜测为真且讨论了某些图与圈之并图的圈唯一性.     

Factorization Index for Completely Positive Graphs

In this paper, we prove that the set of all factorization indices of a completely positive graph has no gaps. In other words, we give an affirmative answer to a question raised by N. Kogan and A. Berman [8] in the case of completely positive graphs. Received December 9, 1997, Accepted May 16, 2002     

The completely positive and doubly nonnegative completion problems

We prove the following. Let G be an undirected graph. Every partially specified symmetric matrix, the graph of whose specified entries is G and each of whose fully specified submatrices is completely positive (equal to BB^T for some entrywise nonnegative matrix B), may be completed to a completely positive matrix if and only if G is a block-clique graph (a chordal graph in which distinct maximal cliques overlap in at most one vertex). The same result holds for matrices that are doubly nonnegative (entrywise nonnegative and positive semidefinite).     

The structure of irreducible matrices †

Let A be an irreducible matrix with index of imprimitivity h is shown that there exists a permutation matrix P such that PAP^t is in a superdiagonal block form with k nonzero blocks if and only if k divides h It is also shown that a matrix in a superdiagonal block form without zero rows or columns is irreducible if and only if the product of the superdiagonal nonzero blocks is irreducible.     

The Curvature and Index of Completely Positive Maps

We study conjugacy invariants for completely positive maps thatare inspired by the concept of curvature introduced for commutingd-tuples of contractions by Arveson. 2000 Mathematics SubjectClassification 46L53, 46L55, 46L57, 46L87, 47L55, 46L07, 46L08     

New results on the cp-rank and related properties of co(mpletely )positive matrices

Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone of completely positive matrices of the same order are dual to each other with respect to the standard scalar product on the space of symmetric matrices. This paper establishes some new relations between orthogonal pairs of such matrices lying on the boundary of either cone. As a consequence, we can establish an improvement on the upper bound of the cp-rank of completely positive matrices of general order and a further improvement for such matrices of order six.     

Completely Positive Definite Maps Over Topological^＊—algebras

ＣｏｍｐｌｅｔｅｌｙＰｏｓｉｔｉｖｅＤｅｆｉｎｉｔｅＭａｐｓＯｖｅｒＴｏｐｏｌｏｇｉｃａｌ－ａｌｇｅｂｒａｓＸｕＴｉａｎｚｈｏｕ（ＤｅｐａｒｔｍｅｎｔｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＢｅｉｊｉｎｇＩｎｓｔｉｔｕｔｅｏｆＴｅｃｈｎｏｆｏｇｙ，...