Permanents of doubly stochastic matrices with fixed zero pattern

The doubly stochastic matrices with a given zero pattern which are closest in Euclidean norm to J_nn, the matrix with each entry equal to 1/n, are identified. If the permanent is restricted to matrices having a given zero pattern confined to one row or to one column, the permanent achieves a local minimum at those matrices with that zero pattern which are closest to J_nn. This need no longer be true if the zeros lie in more than one row or column.     

The doubly stochastic matrix equations x:aty= A and X Aty=t

For a doubly stochastic matrix A, each of the equations x:a^ty= A and X A^ty=^t is shown to have doubly stochastic solutions X and Y if and only if A lies in a subgroup of the semigroup of all doubly stochastic matrices of a given order. All elements of this semigroup which are left regular, right regular, or intra-regular are identified.     

Matrix multiplication is determined by orthogonality and trace

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix multiplication or its opposite.     

Additive mappings on symmetric matrices

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

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.     

The algebraic connectivity of graphs under perturbation

In this paper, we investigate how the algebraic connectivity of a connected graph behaves when the graph is perturbed by separating or grafting an edge.     

Matrix pencils completion problems

In this paper we give a partial solution to the challenge problem posed by Loiseau et al. in [J. Loiseau, S. Mondié, I. Zaballa, P. Zagalak, Assigning the Kronecker invariants of a matrix pencil by row or column completion, Linear Algebra Appl. 278 (1998) 327-336], i.e. we assign the Kronecker invariants of a matrix pencil obtained by row or column completion. We have solved this problem over arbitrary fields.     

Jordan structures of alternating matrix polynomials

Alternating matrix polynomials, that is, polynomials whose coefficients alternate between symmetric and skew-symmetric matrices, generalize the notions of even and odd scalar polynomials. We investigate the Smith forms of alternating matrix polynomials, showing that each invariant factor is an even or odd scalar polynomial. Necessary and sufficient conditions are derived for a given Smith form to be that of an alternating matrix polynomial. These conditions allow a characterization of the possible Jordan structures of alternating matrix polynomials, and also lead to necessary and sufficient conditions for the existence of structure-preserving strong linearizations. Most of the results are applicable to singular as well as regular matrix polynomials.     

On zero-pattern invariant properties of structured matrices

It is interesting that inverse M-matrices are zero-pattern (power) invariant. The main contribution of the present work is that we characterize some structured matrices that are zero-pattern (power) invariant. Consequently, we provide necessary and sufficient conditions for these structured matrices to be inverse M-matrices. In particular, to check if a given circulant or symmetric Toeplitz matrix is an inverse M-matrix, we only need to consider its pattern structure and verify that one of its principal submatrices is an inverse M-matrix.     

Schur-multiplicative maps preserving unitarily invariant norms

Characterizations are obtained for maps on real or complex matrices which preserve both the Schur (Hadamard) product and a given unitarily invariant norm.     

Characterization of ray pattern matrix whose determinantal region has two components after deleting the origin

Ray nonsingular matrices are generalizations of sign nonsingular matrices. The problem of characterizing ray nonsingular matrices is still open. The study of the determinantal regions R_A of ray pattern matrices is closely related to the study of ray nonsingular matrices. It was proved that if R_A?{0} is disconnected, then it is a union of two opposite open sectors (or open rays). In this paper, we characterize those ray patterns whose determinantal regions become disconnected after deleting the origin. The characterization is based on three classes (F1), (F2) and (F3) of matrices, which can further be characterized in terms of the sets of the distinct signed transversal products of their ray patterns. Moreover, we show that in the fully indecomposable case, a matrix A is in the class (F1) (or (F2), respectively) if and only if A is ray permutation equivalent to a real SNS (or non-SNS, respectively) matrix.     

Classification of sesquilinear forms with the first argument on a subspace or a factor space

Let V be a vector space over a field or skew field F, and let U be its subspace. We study the canonical form problem for bilinear or sesquilinear forms

     

Enlargements of filtrations and path decompositions at non stopping times

Azéma associated with an honest time L the supermartingale and established some of its important properties. This supermartingale plays a central role in the general theory of stochastic processes and in particular in the theory of progressive enlargements of filtrations. In this paper, we shall give an additive characterization for these supermartingales, which in turn will naturally provide many examples of enlargements of filtrations. We combine this characterization with some arguments from both initial and progressive enlargements of filtrations to establish some path decomposition results, closely related to or reminiscent of Williams' path decomposition results. In particular, some of the fragments of the paths in our decompositions end or start with a new family of random times which are not stopping times, nor honest times.     

Theory and method for updating least-squares finite element model of symmetric generalized centro-symmetric matrices

Let X,F$X,F$ be a displacement matrix and load matrix, respectively. C (obtained by calculations or measurements) is an estimate matrix of the analytical model. A method is presented for correction of the model C, based on the theory of inverse problem of matrices. The corrected model is symmetric generalized centro-symmetric with specified displacements and loads, satisfying the mechanics characters of finite-element model. The application of the method is illustrated. It is more important that a perturbation analysis is given, which is not given in the earlier papers. Numerical results show that the method is feasible and effective.     

On a matrix decomposition of Hartwig and Spindelböck

The main task of the paper is to demonstrate that Corollary 6 in [R.E. Hartwig, K. Spindelböck, Matrices for which A^∗ and A^† commute, Linear and Multilinear Algebra 14 (1984) 241-256] provides a powerful tool to investigate square matrices with complex entries. This aim is achieved, on the one hand, by obtaining several original results involving square matrices, and, on the other hand, by reestablishing some of the facts already known in the literature, often in extended and/or generalized forms. The particular attention is paid to the usefulness of the aforementioned corollary to characterize various classes of matrices and to explore matrix partial orderings.     

Partial matrices whose completions have ranks bounded below

A partial matrix over a field F is a matrix whose entries are either elements of F or independent indeterminates. A completion of such a partial matrix is obtained by specifying values from F for the indeterminates. We determine the maximum possible number of indeterminates in a partial m×n matrix whose completions all have rank at least equal to a particular k, and we fully describe those examples in which this maximum is attained. Our main theoretical tool, which is developed in Section 2, is a duality relationship between affine spaces of matrices in which ranks are bounded below and affine spaces of matrices in which the (left or right) nullspaces of elements possess a certain covering property.     

Schur product of matrices and numerical radius (range) preserving maps

Let F(A) be the numerical range or the numerical radius of a square matrix A. Denote by A ° B the Schur product of two matrices A and B. Characterizations are given for mappings on square matrices satisfying F(A ° B) = F(?(A) ° ?(B)) for all matrices A and B. Analogous results are obtained for mappings on Hermitian matrices.     

Isospectral flows that preserve matrix structure

The matrix A = (a_ij) ∈ S_n is said to lie on a strict undirected graph G if a_ij = 0 (i ≠ j) whenever (i, j) is not in E(G). If S is skew-symmetric, the isospectral flow maintains the spectrum of A. We consider isospectral flows that maintain a matrix A(t) on a given graph G. We review known results for a graph G that is a (generalised) path, and construct isospectral flows for a (generalised) ring, and a star, and show how a flow may be constructed for a general graph. The analysis may be applied to the isospectral problem for a lumped-mass finite element model of an undamped vibrating system. In that context, it is important that the flow maintain other properties such as irreducibility or positivity, and we discuss whether they are maintained.     

On D. Hägele’s approach to the Bessis-Moussa-Villani conjecture

The reformulation of the Bessis-Moussa-Villani (BMV) conjecture given by Lieb and Seiringer asserts that the coefficient α_m,k(A,B) of t^k in the polynomial Tr(A+tB)^m, with A,B positive semidefinite matrices, is nonnegative for all m,k. We propose a natural extension of a method of attack on this problem due to Hägele, and investigate for what values of m,k the method is successful, obtaining a complete determination when either m or k is odd.