关于布尔关系友阵（英）

ＯｎＣｏｍｐａｎｉｏｎＢｏｏｌｅａｎＲｅｌａｔｉｏｎＭａｔｒｉｃｅｓＣｈａｏＣｈｏｎｇｙｕｎ（Ｄｅｐｔ．ｏｆＭａｔｈＵｎｉｖｏｆＰｉｔｔｓｂｕｒｇｈＰｉｔｔｓｂｕｒｇｈ，ＰＡ１５２６０）ＷａｎｇＴｉａｎｍｉｎｇ（Ｉｎｓｔ．ｏｆＭａｔｈ．Ｓｃｉｅｎｃｅ...     

On generalized inverses of Boolean Matrices

Generalized inverses of Boolean Matrices are defined and the general form of matrices having generalized inverses is determined. Some structure theorems are proved, from which, some known results are obtained as corollaries. An algorithm to compute a generalized inverse of a matrix, when it exists, is given. The existence of various types of g-inverses is also investigated. All the results are obtained first for the {0,1}-Boolean algebra and then extended to an arbitrary Boolean algebra.     

布尔矩阵的幂敛指数集

给出了不含非零对角元的ｎ阶布尔矩阵的幂敛指数集的明显表达式,从而完全解决了布尔矩阵依赖于非零对角元个数的幂敛指数集的刻画问题。     

On the Cardinalities of Row Spaces of Boolean Matrices

No Abstract. February 8, 1999     

On Convergence of the Min-Max Compositions of Fuzzy Matrices

In this paper, we study some of properties of the min-max compositions of fuzzy matrices and give out a dual theorem (to Theorem 3 of [4]) about the convergence of the power sequence of min-max compositions of fuzzy matrices.AMS Subject Classification (2000) 15A45 06A06 04A72     

Bool阵的逆阵

We give a characterization of a regular Boolean matrix and prove that AB = I Implies that BA = I, where A and B are Boolean matrices whose elements belong to a Boolean algebra of a set with more than two elements.     

On the Cardinalities of the Row spaces of Non-full Rank Boolean Matrices

n -2 integers 2 ^{n -2}+2 ^{n -3}+2 ^s, where s=0,1,2,..., n-3, in the interval (2 ^{n -2}+2 ^{n -3},2 ^{n -1}] such that these integers are the cardinalities of row spaces R(A) of non-full rank Boolean matrices A of order n. We also show that for each s, where s=0,1,2,..., n-3, there exists A epsilon B _n such that A is non-full rank and the cardinality of R(A) equals 2 ^{n -2}+2 ^{n -3}+2 ^s.     

Generalized Indices of Boolean Matrices

We obtain upper bounds for generalized indices of matrices in the class of nearly reducible Boolean matrices and in the class of critically reducible Boolean matrices, and prove that these bounds are the best possible.     

On the Group of Symplectic Matrices Over a Free Associative Algebra

Symplectic groups are well known as the groups of isometriesof a vector space with a non-singular bilinear alternating form.These notions can be extended by replacing the vector spaceby a module over a ring R, but if R is non-commutative, it willalso have to have an involution. We shall here be concernedwith symplectic groups over free associative algebras (witha suitably defined involution). It is known that the generallinear group GL_n over the free algebra is generated by the setof all elementary and diagonal matrices (see [1, Proposition2.8.2, p. 124]). Our object here is to prove that the symplecticgroup over the free algebra is generated by the set of all elementarysymplectic matrices. For the lowest order this result was obtainedin [4]; the general case is rather more involved. It makes useof the notion of transduction (see [1, 2.4, p. 105]). When thereis only a single variable over a field, the free algebra reducesto the polynomial ring and the weak algorithm becomes the familiardivision algorithm. In that case the result has been provedin [3, Anhang 5].     

布尔代数的模糊点理想

研究了布尔代数的模糊点理想及其相关性质,证明了布尔代数的模糊点理想的交、同态像和同态逆像等也是布尔代数的模糊点理想.     

关于阶数为奇数的布尔矩阵行空间的基数

设Ｂｎ表示所有的ｎ阶布尔矩阵的集合，Ｒ（Ａ）表示Ａ∈Ｂｎ的行空间，｜Ｒ（Ａ）｜表示Ｒ（Ａ）的基数．设ｍ，ｎ为正整数，本文证明了（Ⅰ）ｍ∈［１，４６］，［１，７８］，分别存在Ａ∈Ｂ７，Ａ∈Ｂ８，使得｜Ｒ（Ａ）｜＝ｍ．（Ⅱ）当ｎ≥９为奇数时，则ｍ∈［１，２（ｎ＋３）／２＋２（ｎ＋１）／２＋…＋２３］，存在Ａ∈Ｂｎ，使得｜Ｒ（Ａ）｜＝ｍ．     

布尔矩阵的指标格

本文首先构造了由一个布尔矩阵的特定行指标和列指标对所确定的指标格,然后刻画了指标格的同态像、直积和子格所对应的布尔矩阵的性质.     

圈布尔矩阵类的幂敛指数集

在布尔运算下, 布尔矩阵A的幂敛指数和周期分别是使A^k=A^k+p成立的最小非负整数k和最小正整数p. 人们对周期的认识已经相当完善.给定满足一个不等式的正整数n和s, 利用组合分析确定了有向图含至少一个s -圈的n×n布尔矩阵的幂敛指数可以取得的数值.     

关于布尔矩阵半群和非负矩阵半群的几点注记

本文重点讨论了布尔矩阵半群中的幂等、广义幂等、素矩阵以及它们之间的联系，对非负矩阵半群上的类零型结构也进行了研究．     

The Algebra of Matrices in N-dimensional Systems

The N-dimensional Roesser matrix is defined and shown to beessential to the formal solution of the N-dimensional Roesserequations. An extended Cayley-Hamilton theorem and a Leverrier-Fadeevtype algorithm are dervied for N-dminesional systems. One formof decomposition of the matrices is considered, and two particularcases are evaluated in terms of one-dimensional matrics.