A note on circulant transition matrices in Markov chains

Let g and n be positive integers and gcd(g,n)=1. Let C=(c_ij) be a g-circulant transition matrix of order n of Markov chain. We are interested in studying and lim_k→∞C^k.     

On disjoint range matrices

For a square complex matrix F and for F^∗ being its conjugate transpose, the class of matrices satisfying R(F)∩R(F^∗)={0}, where R(.) denotes range (column space) of a matrix argument, is investigated. Besides identifying a number of its properties, several functions of F, such as F+F^∗, (F:F^∗), FF^∗+F^∗F, and F-F^∗, are considered. Particular attention is paid to the Moore-Penrose inverses of those functions and projectors attributed to them. It is shown that some results scattered in the literature, whose complexity practically prevents them from being used to deal with real problems, can be replaced with much simpler expressions when the ranges of F and F^∗ are disjoint. Furthermore, as a by-product of the derived formulae, one obtains a variety of relevant facts concerning, for instance, rank and range.     

Cayley transform and the Kronecker product of Hermitian matrices

We consider the conditions under which the Cayley transform of the Kronecker product of two Hermitian matrices can be again presented as a Kronecker product of two matrices and, if so, if it is a product of the Cayley transforms of the two Hermitian matrices. We also study the related question: given two matrices, which matrix under the Cayley transform yields the Kronecker product of their Cayley transforms.     

Semigroup of matrices acting on the max-plus projective space

We investigate the action of semigroups of d×d matrices with entries in the max-plus semifield on the max-plus projective space. Recall that semigroups generated by one element with projectively bounded image are projectively finite and thus contain idempotent elements.In terms of orbits, our main result states that the image of a minimal orbit by an idempotent element of the semigroup with minimal rank has at most d! elements. Moreover, each idempotent element with minimal rank maps at least one orbit onto a singleton.This allows us to deduce the central limit theorem for stochastic recurrent sequences driven by independent random matrices that take countably many values, as soon as the semigroup generated by the values contains an element with projectively bounded image.     

Notes on Hilbert and Cauchy matrices

Inspired by examples of small Hilbert matrices, the author proves a property of symmetric totally positive Cauchy matrices, called AT-property, and consequences for the Hilbert matrix.     

Additive mappings on symmetric matrices

Additive mappings, which do not increase the minimal rank of symmetric matrices are classified in characteristic two or three.     

Multispherical Euclidean distance matrices

In this paper we introduce new necessary and sufficient conditions for an Euclidean distance matrix to be multispherical. The class of multispherical distance matrices studied in this paper contains not only most of the matrices studied by Hayden et al. (1996) 2, but also many other multispherical structures that do not satisfy the conditions in Hayden et al. (1996) 2.We also study the information provided by the origin of coordinates when it is placed at the center of the spheres and the origin representation property is satisfied. These vectors associated with the origin of coordinates generate a number of supporting hyperplanes for a family of multispherical matrices and also describe part of the null space of the corresponding distance matrices.     

Congruence of Hermitian matrices by Hermitian matrices

Two Hermitian matrices A,B∈M_n(C) are said to be Hermitian-congruent if there exists a nonsingular Hermitian matrix C∈M_n(C) such that B=CAC. In this paper, we give necessary and sufficient conditions for two nonsingular simultaneously unitarily diagonalizable Hermitian matrices A and B to be Hermitian-congruent. Moreover, when A and B are Hermitian-congruent, we describe the possible inertias of the Hermitian matrices C that carry the congruence. We also give necessary and sufficient conditions for any 2-by-2 nonsingular Hermitian matrices to be Hermitian-congruent. In both of the studied cases, we show that if A and B are real and Hermitian-congruent, then they are congruent by a real symmetric matrix. Finally we note that if A and B are 2-by-2 nonsingular real symmetric matrices having the same sign pattern, then there is always a real symmetric matrix C satisfying B=CAC. Moreover, if both matrices are positive, then C can be picked with arbitrary inertia.     

Bounded distance preserving surjections in the projective geometry of matrices

We examine surjective maps which preserve a fixed bounded distance in both directions on some classical dual polar spaces.     

Subtotally positive and Monge matrices

A real matrix is called k-subtotally positive if the determinants of all its submatrices of order at most k are positive. We show that for an m × n matrix, only mn inequalities determine such class for every k, 1 ? k ? min(m,n). Spectral properties of square k-subtotally positive matrices are studied. Finally, completion problems for 2-subtotally positive matrices and their additive counterpart, the anti-Monge matrices, are investigated. Since totally positive matrices are 2-subtotally positive as well, the presented necessary conditions for this completion problem are also necessary conditions for totally positive matrices.     

On polynomial EkP matrices

In this paper the relation betweenEP--matrices andE ^k P--matrices over an arbitrary filedF is studied. Further, conditions for the product ofE ^k P--matrices to be anE ^k P--matrix and for the reverse order law to hold for the polynomial Moore-Penrose inverse of the product ofE ^k P--matrices are determined     

Intrinsic products and factorizations of matrices

We say that the product of a row vector and a column vector is intrinsic if there is at most one nonzero product of corresponding coordinates. Analogously we speak about intrinsic product of two or more matrices, as well as about intrinsic factorizations of matrices. Since all entries of the intrinsic product are products of entries of the multiplied matrices, there is no addition. We present several examples, together with important applications. These applications include companion matrices and sign-nonsingular matrices.     

Tensor Sylvester matrices and the Fisher information matrix of VARMAX processes

The purpose of this paper is to develop compact expressions for the Fisher information matrix (FIM) of a Gaussian stationary vector autoregressive and moving average process with exogenous or input variables, a vector ARMAX or VARMAX process. We develop a representation of the FIM based on multiple Sylvester matrices. An extension of this representation yields another one but in terms of tensor Sylvester matrices. In order to obtain the results presented in this paper, the approach used in [A. Klein, G. Mélard, P. Spreij, On the resultant property of the Fisher information matrix of a vector ARMA process, Linear Algebra Appl. 403 (2005) 291-313] is extended.     

Imbedding conditions for normal matrices

When can an (n-k)×(n-k) normal matrix B be imbedded in an n×n normal matrix A? This question was studied for the first time 50 years ago by Ky Fan and Gordon Pall, who gave the complete answer in the case k=1. Since then, a few authors obtained additional results. In this note, we show how an approach inspired by the Hermitian case can throw some light on the problem.     

Total nonpositivity of nonsingular matrices

In this paper, nonsingular totally nonpositive matrices are studied and new characterizations are provided in terms of the signs of minors with consecutive initial rows or consecutive initial columns. These characterizations extend an existing characterization that uses some restrictive hypotheses.     

Triangular factors of Cauchy and Vandermonde matrices

Explicit formulas for triangular factors of Cauchy and Vandermonde matrices and their inverses in terms of entries of these matrices are presented.     

HGAH矩阵的逆特征值问题

In this paper, the inverse eigenvalue problem of Hermitian generalized anti-Hamihonian matrices and relevant optimal approximate problem are considered. The necessary and sufficient conditions of the solvability for inverse eigenvalue problem and an expression of the general solution of the problem are derived. The solution of the relevant optimal approximate problem is given.     

On prime factors of determinants of circulant matrices

We find the probability that the determinant of an integer circulant n×n matrix is divisible by the prime p (where p does not divide n).     

Linear complexity algorithm for semiseparable matrices

A new linear complexity algorithm for general nonsingular semiseparable matrices is presented. For symmetric matrices whose semiseparability rank equals to 1 this algorithm leads to an explicit formula for the inverse matrix.Supported in part by the NSF Grant DMS 9306357     

A note about bistellar operations on PL-manifolds with boundary

In 1990, U. Pachner proved that simplicial triangulations of the same PL-manifold (with boundary) are always connected by a finite sequence of transformations belonging to two different groups:shelling operations (and their inverses), which work mostly with the boundary triangulations, andbistellar operations, which affect only the interior of the triangulations.The purpose of this note is to prove that, in case of simplicial triangulations coinciding on the boundary, bistellar operations are sufficient to solve the homeomorphism problem.Work performed under the auspicies of the GNSAGA of the CNR (National Research Council of Italy) and financially supported by MURST of Italy (project Geometria Reale e Complessa).