Generalized fuzzy matrices

We give a systematic development of fuzzy matrix theory. Many of our results generalize to matrices over the two element Boolean algebra, over the nonnegative real numbers, over the nonnegative integers, and over the semirings, and we present these generalizations. Our first main result is that while spaces of fuzzy vectors do not have a unique basis in general they have a unique standard basis, and the cardinality of any two bases are equal. Thus concepts of row and column basis, row and column rank can be defined for fuzzy matrices. Then we study Green's equivalence classes of fuzzy matrices. New we give criteria for a fuzzy matrix to be regular and prove that the row and column rank of any regular fuzzy matrix are equal. Various inverses are also studied. In the next section, we obtain bounds for the index and period of a fuzzy matrix.     

Recognizing Balanceable Matrices

A 0/±1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entries per row and per column in which the sum of all entries is 2 modulo 4. A 0/1 matrix is balanceable if its nonzero entries can be signed ±1 so that the resulting matrix is balanced. A signing algorithm due to Camion shows that the problems of recognizing balanced 0/±1 matrices and balanceable 0/1 matrices are equivalent. Conforti, Cornuéjols, Kapoor and Vušković gave an algorithm to test if a 0/±1 matrix is balanced. Truemper has characterized balanceable 0/1 matrices in terms of forbidden submatrices. In this paper we give an algorithm that explicitly finds one of these forbidden submatrices or shows that none exists. Received: October 2004     

Quantale矩阵的合成

给出Q uan tale矩阵的几类合成运算,并且讨论了合成运算的一系列好的性质。     

On Some Properties of Convex Matrix Sets Characterized by P -Matrices and Block P -Matrices

In this paper, we consider convex sets of real matrices and establish criteria characterizing these sets with respect to certain matrix properties of their elements. In particular, we deal with convex sets of P-matrices, block P-matrices and M-matrices, nonsingular and full rank matrices, as well as stable and Schur stable matrices. Our results are essentially based on the notion of a block P-matrix and extend and generalize some recently published results on this topic.     

Additive Decomposition of Real Matrices

The orthogonal orbit ${\cal O}(A)$ of an n × n real matrix A is the set of real matrices of the form $P^t \ AP$ where $P^t P = I_n$ . We show that $A/ \| A\|$ is an affine sum of four orthogonal matrices, and note that $A^t$ can always be written as an affine combination of no more than 2 n m 1 matrices in ${\cal O}(A)$ . This improves some recent results of Zhan, and answers some of his questions. Other related results are also discussed.     

Sign Regular Matrices of Order Two

A matrix is called sign regular of order k if every minor of order i has the same sign for each i = 1,2,<, k . If an m × n matrix is sign regular of order k for k = min { m,n } then it is called sign regular. This paper studies some properties of sign regular matrices of order two. Remarkable properties are proved when the row sums of these matrices form a monotone vector.     

On some characterisations of totally unimodular matrices

A characterisation of totally unimodular matrices is derived from a result of Hoffman and Kruskal. It is similar in spirit to a result of Baum and Trotter. Its relation with some other known characterisations is discussed and in the particular case where the matrices have (0, 1) entries, we derive some properties of the associated unimodular hypergraphs. Similar results for balanced and perfect matrices are also reviewed.     

On Some Properties of Convex Matrix Sets Characterized by P -Matrices and Block P -Matrices

In this paper, we consider convex sets of real matrices and establish criteria characterizing these sets with respect to certain matrix properties of their elements. In particular, we deal with convex sets of P-matrices, block P-matrices and M-matrices, nonsingular and full rank matrices, as well as stable and Schur stable matrices. Our results are essentially based on the notion of a block P-matrix and extend and generalize some recently published results on this topic.     

Qualitatively invertible matrices

Our purpose is to describe the properties of the class of n×n matrices such that some or all of the signs of the nonzero elements of the inverse matrix can be determined based only upon the knowledge of the signs of the matrix being inverted. Applications of such matrices can be found in the study of the testibility of economic theory, the stability of economic systems and the general ‘quality’ of solutions to large computer models.     

Invariants of matrix pairs over discrete valuation rings and Littlewood-Richardson fillings

Let M and N be two r×r matrices of full rank over a discrete valuation ring R with residue field of characteristic zero. Let P,Q and T be invertible r×r matrices over R. It is shown that the orbit of the pair (M,N) under the action (M,N)?(PMQ^-1,QNT^-1) possesses a discrete invariant in the form of Littlewood-Richardson fillings of the skew shape λ/μ with content ν, where μ is the partition of orders of invariant factors of M, ν is the partition associated to N, and λ the partition of the product MN. That is, we may interpret Littlewood-Richardson fillings as a natural invariant of matrix pairs. This result generalizes invariant factors of a single matrix under equivalence, and is a converse of the construction in Appleby (1999) [1], where Littlewood-Richardson fillings were used to construct matrices with prescribed invariants. We also construct an example, however, of two matrix pairs that are not equivalent but still have the same Littlewood-Richardson filling. The filling associated to an orbit is determined by special quotients of determinants of a matrix in the orbit of the pair.     

The DJL Conjecture for CP Matrices over Special Inclines

Drew, Johnson, and Loewy conjectured that for n ≥ 4, the CP-rank of every n × n completely positive real matrix is at most [n²/4]. While this conjecture has recently been disproved for completely positive real matrices, we show that this conjecture is true for n × n completely positive matrices over certain special types of inclines. In addition, we prove an incline version of Markham's theorems which gives sufficient conditions for completely positive matrices over special inclines to have triangular factorizations.     

Poincaré series of semi-invariants of 2×2 matrices

The Poincaré series of the algebra of -invariants of m-tuples of 2×2 matrices is presented both as a rational function and as a series of Schur functions. We show that this algebra of invariants is generated by the determinants, the mixed discriminants and the discriminants of 2×2 matrices. Consequences on invariants of three-dimensional matrices of the shape 2×2×m are discussed. For arbitrary n2, we prove an explicit functional equation for the Poincaré series of the -invariants of m-tuples of n×n matrices.     

关于r－循环矩阵的非异性

本文给出了仅用ｒ－循环矩阵的元素本身和参数ｒ便可做出判断其非异性的五种方法。     

Some perturbation results for the Linear Complementarity Problem

It has been shown previously that the Linear Complementarity Problem is stable when the defining matrix is positive semidefinite and when (locally) the set of solutions is nonempty and bounded. We enlarge the class of matrices for which this is true and also demonstrate how the boundedness condition leads to other stability type questions.     

Similarity Classes of 3 × 3 Matrices Over a Local Principal Ideal Ring

In this article similarity classes of three by three matrices over a local principal ideal commutative ring are analyzed. When the residue field is finite, a generating function for the number of similarity classes for all finite quotients of the ring is computed explicitly.     

模糊关系矩阵传递闭包的Warshall算法

通过对照关系的传递闭包和模糊关系的传递闭包，把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。     

幂等右侧Quantale上的幂零矩阵

讨论幂等右侧Quantale上的幂零矩阵的若干性质，给出了幂等右侧Quantale上的矩阵为幂零矩阵的充要条件，得到了幂零矩阵的幂零指数的刻画定理。     

Principal Submatrices of a Hermitian Matrix

Suppose k 1 ,<, k m and n are positive integers such that k 1 + … + k m h n . We characterize those k i × k i Hermitian matrices A i , i = 1, < , m that can appear as diagonal blocks of an n × n Hermitian matrix C with prescribed eigenvalues. The characterization will be given in terms of the eigenvalues of C and A i , i = 1, <, m . Our results extend those of Thompson and Freede, Horn, Fan and Pall.     

奇异四元数矩阵的正态及Wishart分布

本文利用拉直算子(vec)和Kronecker积求得了四元数矩阵的实表示矩阵的一些性质,在此基础上利用实矩阵的奇异正态分布密度函数,求出了四元数矩阵的奇异正态分布的密度函数表达式.由此得到四元数矩阵奇异Wishart分布的密度函数表达式.