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.     

INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES

1　IntroductionIn qualitative and combinatorial matrix theory,we study properties ofa matrix basedon combinatorial information,such as the signs of entries in the matrix.A matrix whoseentries are from the set{ + ,-,0 } is called a sign pattern matrix ( or sign pattern,or pat-tern) .We denote the setof all n× n sign pattern matrices by Qn.For a real matrix B,sgn( B) is the sign pattern matrix obtained by replacing each positive( respectively,negative,zero) entry of B by+ ( respectively,-,0 )…     

On the point spectrum of periodic Jacobi matrices with matrix entries: elementary approach

This work consists of two parts. The first one contains a characterization (localization) of the point spectrum of one sided, infinite and periodic Jacobi matrices with scalar entries. The second one deals with the same questions about one sided, infinite periodic Jacobi matrices with matrix entries. In particular, an example illustrating the difference between the above localization property in scalar and matrix entries cases is given.     

布尔矩阵的幂敛指数集

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

Vertex degrees and doubly stochastic graph matrices

In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graph matrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris' question on doubly stochastic graph matrices. These results may also be used to establish relations between graph structure and entries of doubly stochastic graph matrices. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:104‐114, 2011     

Bounds on the inverses of nonnegative triangular matrices with monotonicity properties

Some bounds on the entries and on the norm of the inverse of triangular matrices with nonnegative and monotone entries are found. All the results are obtained by exploiting the properties of the fundamental matrix of the recurrence relation which generates the sequence of the entries of the inverse matrix. One of the results generalizes a theorem contained in a recent article of one of the authors about Toeplitz matrices.     

Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices

We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs.     

Entries of the group inverse of the Laplacian matrix for generalized Johnson graphs

In this paper, we use graph theoretic properties of generalized Johnson graphs to compute the entries of the group inverse of Laplacian matrices for generalized Johnson graphs. We then use these entries to compute the Zenger function for the group inverse of Laplacian matrices of generalized Johnson graphs.     

A sufficient condition for a non-negative matrix to have non-negative determinant

It is shown that a matrix with non-negative entries has non-negative determinant if in each row the elements decrease, by steadily smaller amounts, as one proceeds (in either direction) away from the main diagonal. This condition suffices to establish non- negativity of the determinant for certain matrices to which the familiar Minkowski- Hadamard-Ostrowski dominance conditions do not apply. In the symmetric case it provides a sufficient condition for non-negative definiteness. This may be applied to establish the positive definiteness of certain real symmetric Toeplitz matrices.     

无界分块算子矩阵的谱分布

本文首先给出次对角元有界的2×2阶无界算子矩阵的Gershgorin定理,然后利用主对角元算子的谱和数值域刻画整个算子矩阵的谱分布.特别地,当次对角元算子互为共轭(反共轭)算子时,结合二次数值域和Gershgorin定理对谱分布给出更精细的描述.     

On the inverse of certain patterned sums of matrices with Kronecker product structures

In this article, we derive explicit expressions for the entries of the inverse of a patterned matrix that is a sum of Kronecker products. This matrix keeps the Kronecker structure under matrix inversion, and it is used, for example, in statistics, in particular in the linear mixed model analysis. The obtained results present new and extended existing algorithms for the inversion of the considered patterned matrices. We also obtain a closed-form inverse in terms of block matrices.     

Enumeration of symmetry classes of alternating sign matrices and characters of classical groups

An alternating sign matrix is a square matrix with entries 1, 0 and −1 such that the sum of the entries in each row and each column is equal to 1 and the nonzero entries alternate in sign along each row and each column. To some of the symmetry classes of alternating sign matrices and their variations, G. Kuperberg associate square ice models with appropriate boundary conditions, and give determinant and Pfaffian formulae for the partition functions. In this paper, we utilize several determinant and Pfaffian identities to evaluate Kuperberg's determinants and Pfaffians, and express the round partition functions in terms of irreducible characters of classical groups. In particular, we settle a conjecture on the number of vertically and horizontally symmetric alternating sign matrices (VHSASMs). Dedicated to the memory of David Robbins.     

On properties of cell matrices

In this paper properties of cell matrices are studied. A determinant of such a matrix is given in a closed form. In the proof a general method for determining a determinant of a symbolic matrix with polynomial entries, based on multivariate polynomial Lagrange interpolation, is outlined. It is shown that a cell matrix of size n>1 has exactly one positive eigenvalue. Using this result it is proven that cell matrices are (Circum-)Euclidean Distance Matrices ((C)EDM), and their generalization, k-cell matrices, are CEDM under certain natural restrictions. A characterization of k-cell matrices is outlined.     

Stanley's zrank conjecture on skew partitions

We present an affirmative answer to Stanley's zrank conjecture, namely, the zrank and the rank are equal for any skew partition. We show that certain classes of restricted Cauchy matrices are nonsingular and furthermore, the signs are determined by the number of zero entries. We also give a characterization of the rank in terms of the Giambelli-type matrices of the corresponding skew Schur functions. Our approach also applies to the factorial Cauchy matrices and the inverse binomial coefficient matrices.

     

DNA序列的特征数值及相似性分析

利用2维图表示DNA序列,计算与该图对应的距离矩阵,求出距离矩阵的不变量—距离矩阵主对角线以外的次对角线之和的平均值,进而得到了DNA序列的一种特征数值,利用这种新的特征数值,对DNA序列进行相似性比较,得到了与现有的资料符合很好的结果.     

局部环上矩阵广义逆半群的子集及其性质

设R是一个局部环,A是一个可相似对角化的n阶矩阵.利用矩阵方法研究了环R上矩阵A的广义逆半群的子集,得到了其做成正规子群的条件和其中元素可逆的条件,也得到了矩阵广义逆半群的一些性质.     

Kernel structure of Toeplitz-plus-Hankel matrices

The structure of the kernel of block Toeplitz-plus-Hankel matrices R=[a_j−k+b_j+k], where a_j and b_j are the given p×q blocks with entries from a given field, is investigated. It is shown that R corresponds to two systems of at most p+q vector polynomials from which a basis of the kernel of R and all other Toeplitz-plus-Hankel matrices with the same parameters a_j and b_j can be built. The main result is an analogue of a known kernel structure theorem for block Toeplitz and block Hankel matrices.     

Natural density distribution of Hermite normal forms of integer matrices

The Hermite Normal Form (HNF) is a canonical representation of matrices over any principal ideal domain. Over the integers, the distribution of the HNFs of randomly looking matrices is far from uniform. The aim of this article is to present an explicit computation of this distribution together with some applications. More precisely, for integer matrices whose entries are upper bounded in absolute value by a large bound, we compute the asymptotic number of such matrices whose HNF has a prescribed diagonal structure. We apply these results to the analysis of some procedures and algorithms whose dynamics depend on the HNF of randomly looking integer matrices.     

GENERALIZED NEKRASOV MATRICES AND APPLICATIONS

In this paper,the concpet of generalized Nekrasov matrices in introduced,some prop-erties of these matrices are discussed,obtained equivalent representation of generalized diagonally dominant matrices.     

Highly symmetric generalized circulant permutation matrices

In this paper we investigate generalized circulant permutation matrices of composite order. We give a complete characterization of the order and the structure of symmetric generalized k-circulant permutation matrices in terms of circulant and retrocirculant block (0, 1)-matrices in which each block contains exactly one or two entries 1. In particular, we prove that a generalized k-circulant matrix A of composite order n = km is symmetric if and only if either k = m − 1 or k ≡ 0 or k ≡ 1 mod m, and we obtain three basic symmetric generalized k-circulant permutation matrices, from which all others are obtained via permutations of the blocks or by direct sums. Furthermore, we extend the characterization of these matrices to centrosymmetric matrices.