Products of irreducible matrices

In this paper we characterize the subsemigroup of B_n (B_n is the multiplicative semigroup of n × n Boolean matrices) generated by all the irreducible matrices, and hence give a necessary and sufficient condition for a Boolean matrix A to be a product of irreducible Boolean matrices. We also give a necessary and sufficient condition for an n × n nonnegative matrix to be a product of nonnegative irreducible matrices.     

Matrices permutation equivalent to primitive matrices

We give a necessary and sufficient condition for an n×n (0,1) matrix (or more generally, an n×n nonnegative matrix) to be permutation equivalent to a primitive matrix. More precisely, except for two simple permutation equivalent classes of n×n (0,1) matrices, each n×n (0,1) matrix having no zero row or zero column is permutation equivalent to some primitive matrix. As an application, we use this result to characterize the subsemigroup of B_n (B_n is the multiplicative semigroup of n×n Boolean matrices) generated by all the primitive matrices and permutation matrices. We also consider a more general problem and give a necessary and sufficient condition for an n×n nonnegative matrix to be permutation equivalent to an irreducible matrix with given imprimitive index.     

An extension of the Kreiss stability theorem to families of matrices of unbounded order

The Kreiss matrix theorem asserts three necessary and sufficient conditions for a family of matrices of fixed finite order to be L₂-stable: a resolvent condition (R), a triangularization condition (S) and a Hermitian norm condition (H). We extend the Kreiss theorem to families of matrices of finite but unbounded order with the restriction that the degrees of the minimal polynomials of all matrices in the family are less than a fixed constant. For such matrix families, we show that (R) and (H) remain necessary and sufficient for L₂-stability, while (S) must be replaced by a somewhat stronger “block triangularization” condition (S′). This extended Kreiss theorem permits a corresponding extension of the Buchanan stability theorem.     

On some properties of circulant matrices

A class Σ of matrices is studied which contains, as special subclasses, p-circulant matrices (p ? 1), Toeplitz symmetric matrices and the inverses of some special tridiagonal matrices. We give a necessary and sufficient condition in order that matrices of Σ commute with each other and are closed with respect to matrix product.     

On nonsingular regular magic squares of odd order

Using centroskew matrices, we provide a necessary and sufficient condition for a regular magic square to be nonsingular. Using latin squares and circulant matrices we describe a method of construction of nonsingular regular magic squares of order n where n is an odd prime power.     

Concerning the interior of the D-stable matrices

This paper gives a necessary and sufficient condition for a D-stable matrix to be in the topological interior of the set of D-stable matrices.     

Representing matrices

Let A be a nonnegative real matrix whose column set is countable. We give a necessary and sufficient condition on A for the existence of a nonnegative matrix B, B ? A, with column sums equal to prescribed numbers, and row sums not greater than prescribed numbers. This is a generalization of a result of Damerell and Milner, who solved the problem for (0, 1) matrices.     

An inverse eigenvalue problem for periodic Jacobi matrices in Minkowski spaces

The spectral properties of periodic Jacobi matrices in Minkowski spaces are studied. An inverse problem for these matrices is investigated, and necessary and sufficient conditions under which the problem is solvable are presented. Uniqueness results are also discussed, and an algorithm to construct the solutions and illustrative examples is provided.     

Least-square Solutions of Inverse Problems for Anti-symmetric and Skew-symmetric Matrices

The least-square solutions of inverse problem for anti-symmetric and skew-symmetric matrices are studied. In addition, the problem of using anti-symmetric and skew-symmetric matrices to construct the optimal approximation to a given matrix is discussed, the necessary and sufficient conditions for the problem are derived, and the expression of the solution is provided. A numerical example is given to show the effectiveness of the proposed method.     

反对称次对称矩阵反问题的最小二乘解

The least-square solutions of inverse problem for anti-symmetric and skew-symmetric matrices are studied. In addition, the problem of using anti-symmetric and skew-symmetric matrices to construct the optimal approximation to a given matrix is discussed, the necessary and sufficient conditions for the problem are derived,and the expression of the solution is provided. A numerical example is given to show the effectiveness of the proposed method.     

Partition,Construction, and Enumeration of M–P Invertible Matrices over Finite Fields

A necessary and sufficient condition for an m×n matrix A over F_q having a Moor–Penrose generalized inverse (M–P inverse for short) was given in (C. K. Wu and E. Dawson, 1998, Finite Fields Appl. 4, 307–315). In the present paper further necessary and sufficient conditions are obtained, which make clear the set of m×n matrices over F_q having an M–P inverse and reduce the problem of constructing M–P invertible matrices to that of constructing subspaces of certain type with respect to some classical groups. Moreover, an explicit formula for the M–P inverse of a matrix which is M–P invertible is also given. Based on this reduction, both the construction problem and the enumeration problem are solved by borrowing results in geometry of classical groups over finite fields (Z. X. Wan, 1993, “Geometry of Classical Groups over Finite Fields”, Studentlitteratur, Chatwell Bratt).     

SOME APPLICATIONS OF PLANAR GRAPH IN KNOT THEORY

The relationship between a link diagram and its corresponding planar graph is briefly reviewed.A necessary and sufficient condition is given to detect when a planar graph corresponds to a knot.The rela...     

非广义对角占优矩阵的判定准则

给出了判定非广义对角占优矩阵的充要条件,从理论上彻底解决了不可约非广义对角占优矩阵的判定问题,并给出了判定不可约非广义对角占优矩阵的具体算法.     

特殊五对角与七对角对称正定矩阵的一类反问题

针对线性代数方程组Ax=b,利用矩阵分解的思想,构造一类特殊五对角与七对角对称正定阵的矩阵分解,获得这类矩阵反问题解存在的充要条件和通解表达式.最后,给出了具体算法与数值算例.     

A heuristic Lagrangean algorithm for the capacitated plant location problem — A comment

This is a comment on the paper “A heuristic Lagrangean relaxation algorithm for the capacitated plant location problem” by J. Barcelo and J. Casanovas. The authors have a single source version of the problem where they provide a necessary and sufficient condition for the feasibility of the problem. We show that the condition as shown by the authors is only a necessary condition and not a sufficient condition using an example.     

Criteria for biholomorphic convex mappings on the unit ball in Hilbert spaces

In this paper, we give a necessary and sufficient condition that a locally biholomorphic mapping f on the unit ball B in a complex Hilbert space X is a biholomorphic convex mapping, which improves some results of Hamada and Kohr and solves the problem which is posed by Graham and Kohr. From this, we derive some sufficient conditions for biholomorphic convex mapping. We also introduce a linear operator in purpose to construct some concrete examples of biholomorphic convex mappings on B in Hilbert spaces. Moreover, we give some examples of biholomorphic convex mappings on B in Hilbert spaces.     

Hermite广义Hamilton矩阵反问题的最小二乘解

本文研究了Hermite广义Hamilton矩阵反问题的最小二乘解,利用矩阵的奇异值分解,得到了解的表达式用Hermite广义Hamilton矩阵构造给定定矩阵的最佳逼近问题有解的条件.     

On some sets of permutation matrices

In [5], a class Σ of p×p circulant matrices was studied where p is a prime, and necessary and sufficient conditions were presented for the matrices in Σ to be commutative and to be closed with respect to matrix multiplication. Here we show that these properties also hold for n×n circulant matrices, where n is a positive integer, with an additional condition, namely, Σ contains an n-cycle.     

Truncations of extremal quasiconformal mappings and their applications

In this paper we give a necessary and sufficient condition to decide whether the Teichmüller equivalency class [α] of a truncation α induced by a uniquely extremal Beltrami differential is a Strebel point in T. We also obtain a necessary and sufficient condition of the unique extremality of α. Using the properties of truncations we provide a method to construct Hamilton sequences. We also get a sufficient condition for the extremality of f(z,t) to be equivalent to that of F(w,t). The corresponding results in the infinitesimal case are obtained, too.     

Scattering Theory for CMV Matrices: Uniqueness,Helson–Szegő and Strong Szegő Theorems

We develop a scattering theory for CMV matrices, similar to the Faddeev–Marchenko theory. A necessary and sufficient condition is obtained for the uniqueness of the solution of the inverse scattering problem. We also obtain two sufficient conditions for uniqueness, which are connected with the Helson–Szegő and the strong Szegő theorems. The first condition is given in terms of the boundedness of a transformation operator associated with the CMV matrix. In the second case this operator has a determinant. In both cases we characterize Verblunsky parameters of the CMV matrices, corresponding spectral measures and scattering functions.