不可约与几乎可约布尔矩阵的幂敛指数

§1.引言 布尔矩阵是指元素按如下规则运算的(0,1)矩阵:a+b=max{a,b},a·b=min{a,b}(a,b∈{0,1}),n阶布尔方阵的集合记为B_n。一个布尔方阵A的幂敛指数k(A)是满足如下条件的最小非负整数k: 条件:存在正整数p,使A~k=A~(k+p), (1.1)而称满足条件A~(k(A))=A~(k(A)+p)的最小正整数p为A的周期,记作p(A)。 对布尔矩阵的幂序列及幂敛指数的研究在有限自动机理论、二元关系理论及遍历指     

不可约布尔矩阵的幂敛指数集

本文在[m/p]≥35时([x]表示x的整数部分),刻画了周期为p的n阶不可约布尔矩阵的幂敛指数集I_n,p给出了I_n,p的一个表达式.     

非负循环矩阵的不可约性判定

利用关联矩阵,本文给出了关于非负循环矩阵不可约性及本原性的若干结果。     

非负不可约矩阵的几个新性质

我们知道,非负矩阵在数值分析、概率论、计量经济学等学科中的应用十分广泛,且近年来有关这类矩阵的性质的研究已不少,它们均从不同的角度(利用可达矩阵、图论、矩阵多项式的概念等),给出了这个矩阵的性质及应用。本文从向量、分块矩阵的角度获得了一些新性质,其中也推广了[1]的有关结论,有关背景见[6,7]。     

关于不可约弱广义对角优势阵

本讨论了不可约弱广义对角优势阵的非奇异性及其特征值的分布,进而给出了非奇异Ｍ－阵的几个充分条件。     

对称本原矩阵广义上指数的极矩阵

本文以伴随图的形早了对称本原矩阵和迹零对称本原矩阵的广义上指数的极矩阵。     

“关于不可约弱广义对角优势阵”一文的注记

指出标题所述的论文（见《数学理论与应用》2000年20卷2期）中的错误，分析了产生错误的原因，并给出修正的结果，得到了一类M－矩阵的新表征。     

关于可约布尔矩阵幂敛指数的一个Brualdi─Ross型上界

本文证明了可约布尔矩阵幂敛指数的一个Ｂｒｕａｌｄｉ－Ｒｏｓｓ型上界，并给出了幂敛指数达到此上界的矩阵的完全刻划．     

关于本原矩阵的连续指数集

关于本原矩阵的连续指数集柳柏濂（华南师范大学数学系，广州５１０６３１）ＯＮＴＨＥＣＯＮＴＩＮＵＯＵＳＥＸＰＯＮＥＮＴＳＥＴＯＦＰＲＩＭＩＴＩＶＥＭＡＴＲＩＣＥＳ￥ＬＩＵＢＯＬＩＡＮ（ＳｏｕｔｈＣｈｉｎａＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｇｕａｎｇｚｈ...     

三角形Toeplize矩阵的三角本原指数

讨论了三角形 Toeplize矩阵与一元多项式的关系以及非负三角形 Toeplize矩阵的三角本原指数 ,证明了 n阶非负上三角 Toeplize矩阵的三角本原指数集 Sn={1 ,2 ,… ,k-1 ,k,k1,k2 ,… ,ks,n-1 },其中 k是满足 k >4n -3 -12 和 n -1k +1 =n -1k 的最小整数 .     

Irreducible factorizations of rationalq-parameter matrices

This paper considers rational q-parameter matrices (i.e., matrices the entries of which are ratios of scalar polynomials in q variables) and extends the previous results of the authors. Bibliography: 8 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 248, 1998, pp. 147–164. Translated by V. N. Kublanovskaya.     

Irreducible matrices with reducible principal submatrices

Let A be a (0, 1)-matrix of order n 3 and let s_i⁰(A), i = 1, …, n, be the number of the off diagonal 0's in row and column i of A. We prove that if A is irreducible, and if all its principal submatrices of order (n − 1) are reducible, then s_i⁰(A) n − 1; i = 1, …, n. This establishes the validity of a conjecture by B. Schwarz concerning strongly connected graphs and their primal subgraphs.     

Weak stability for matrices

An n×n complex matrix A is called weak stable if there exists a matrix W such that W+W^* is positive definite and such that AW+W^*A^* is positive definite. In this note several characterizations for weak stability of a matrix are given, and conditions (on A) allowing W to be a diagonal matrix are also considered. A consequence of our results here is a characterization for nonsingular M-matrices.     

Weak ergodicity and products of random matrices

A representation for a weakly ergodic sequence of (nonstochastic) matrices allows products of nonnegative matrices which eventually become strictly positive to be expressed via products of some associated stochastic matrices and ratios of values of a certain function. This formula used in a random setup leads to a representation for the logarithm of a random matrix product. If the sequence of random matrices is in addition stationary then automatically almost all sequences are weakly ergodic, and the representation is expressed in terms of an one-dimensional stationary process. This permits properties of products of random matrices to be deduced from the latter. Second moment assumptions guarantee that central limit theorems and laws of the iterated logarithm hold for the random matrix products if and only if they hold for the corresponding stationary process. Finally, a central limit theorem for some classes of weakly dependent stationary random matrices is derived doing away with the restriction of boundedness of the ratios of colum entries assumed by previous studies. Extensions beyond stationarity are discussed.     

Weak interlacing properties of totally positive matrices

We prove certain interlacing inequalities for the eigenvalues of totally positive matrices.     

Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules

We call an element of a finite general linear group GL(d, q) fat if it leaves invariant and acts irreducibly on a subspace of dimension greater than d/2. Fatness of an element can be decided efficiently in practice by testing whether its characteristic polynomial has an irreducible factor of degree greater than d/2. We show that for groups G with SL(d, q) ≤ G ≤ GL(d, q) most pairs of fat elements from G generate irreducible subgroups, namely we prove that the proportion of pairs of fat elements generating a reducible subgroup, in the set of all pairs in G × G, is less than q ^−d+1. We also prove that the conditional probability to obtain a pair (g ₁, g ₂) in G × G which generates a reducible subgroup, given that g ₁, g ₂ are fat elements, is less than 2q ^−d+1. Further, we show that any reducible subgroup generated by a pair of fat elements acts irreducibly on a subspace of dimension greater than d/2, and in the induced action the generating pair corresponds to a pair of fat elements.     

具变指数非线性拟抛物方程弱解的存在性

虑一类变指数的非线性拟抛物方程的初值问题.在一些初值的假定下,基于时间离散化方法构造逼近解.通过对逼近解的一致性估计,证明了弱解的存在性.     

Irreducible representations of finite exceptional groups of lie type containing matrices with simple spectra

Absolutely irreducible representations of finite groups of exceptional Lie types in defining characteristic whose images contain matrices with simple spectra are determined. The term ”simple spectrum“ means that each eigenvalue has multiplicity 1. The similar question for the classical finite groups has been solved in the authors' previous paper [Comm. in Algebra 26 (1998), no 3, 863-888] where one can find general comments to the problem. For dimensions ≥ 100 all absolutely irreducible representations of finite groups of Lie type in defining characteristic containing matrices with simple spectra are tabulated.